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 23:37highload-churnerhighload-churnerScore: 49,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:2049,876254,801,291243,380,0001,014,00020,480
2Oct 10, 2026 01:2049,897253,479,881243,376,0001,121,00020,480
3Oct 10, 2026 01:2049,919253,559,422243,490,0001,114,00020,480
4Oct 10, 2026 01:2049,921253,609,800243,389,0001,224,00020,480
5Oct 10, 2026 01:2049,926253,613,185243,409,0001,230,00020,480
6Oct 10, 2026 01:2049,936253,742,886243,469,0001,220,00020,480
7Oct 10, 2026 01:2050,002254,052,977243,782,0001,229,00020,480
8Oct 10, 2026 01:2050,002254,023,640243,803,0001,209,00020,480
9Oct 10, 2026 01:2052,151264,542,013254,439,0001,101,00020,480