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 listSep 24, 2026 14:34Andrew EpsteinAndrew EpsteinScore: 313,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 14:35313,3481,545,872,9221,534,293,0001,117,0002,117,632stderr
2Sep 24, 2026 14:35313,4231,546,978,4901,534,655,0001,119,0002,117,632stderr
3Sep 24, 2026 14:35313,4411,546,391,5751,534,749,0001,114,0002,117,632stderr
4Sep 24, 2026 14:35313,4431,547,140,0431,534,762,0001,113,0002,117,632stderr
5Sep 24, 2026 14:35313,4731,546,527,8181,534,897,0001,125,0002,117,632stderr
6Sep 24, 2026 14:35313,4761,547,419,7491,533,907,0002,128,0002,117,632stderr
7Sep 24, 2026 14:35313,5451,547,740,2711,534,233,0002,141,0002,117,632stderr
8Sep 24, 2026 14:35313,9771,549,065,3601,537,369,0001,121,0002,117,632stderr
9Sep 24, 2026 14:35314,0381,549,978,1461,537,681,0001,107,0002,117,632stderr