Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listOct 9, 2026 07:33highload-churnerhighload-churnerScore: 95,606Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:4691,077455,223,823445,222,0001,057,00020,480
2Oct 9, 2026 07:4694,343471,313,932461,182,0001,103,00020,480
3Oct 9, 2026 07:4695,590477,365,943467,261,0001,134,00020,480
4Oct 9, 2026 07:4695,598477,455,862467,319,0001,113,00020,480
5Oct 9, 2026 07:4695,606477,876,421467,426,0001,048,00020,480
6Oct 9, 2026 07:4695,607477,607,776467,416,0001,059,00020,480
7Oct 9, 2026 07:4695,619477,524,330467,472,0001,063,00020,480
8Oct 9, 2026 07:4695,626477,548,221467,508,0001,060,00020,480
9Oct 9, 2026 07:4695,651477,734,791467,552,0001,142,00020,480