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 2, 2026 02:32Victor MerckléVictor MerckléScore: 31,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 02:3231,692164,017,749154,169,0001,124,0002,117,632stderr
2Sep 2, 2026 02:3231,695164,373,234154,211,0001,099,0002,117,632stderr
3Sep 2, 2026 02:3231,697163,796,477154,220,0001,098,0002,117,632stderr
4Sep 2, 2026 02:3231,746163,986,837154,463,0001,095,0002,117,632stderr
5Sep 2, 2026 02:3231,752164,114,092154,446,0001,141,0002,117,632stderr
6Sep 2, 2026 02:3231,753164,018,378154,502,0001,091,0002,117,632stderr
7Sep 2, 2026 02:3231,769163,979,726154,565,0001,106,0002,117,632stderr
8Sep 2, 2026 02:3231,771164,095,349154,571,0001,111,0002,117,632stderr
9Sep 2, 2026 02:3231,789164,210,673154,536,0001,233,0002,117,632stderr