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 listJul 4, 2026 22:56Victor MerckléVictor MerckléScore: 47,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 22:5746,984238,161,336229,219,0001,007,0002,117,632stderr
2Jul 4, 2026 22:5747,012238,361,371229,355,0001,007,0002,117,632stderr
3Jul 4, 2026 22:5747,044238,445,712229,513,0001,006,0002,117,632stderr
4Jul 4, 2026 22:5747,101238,951,393228,783,0002,014,0002,117,632stderr
5Jul 4, 2026 22:5747,224239,433,935229,382,0002,016,0002,117,632stderr
6Jul 4, 2026 22:5747,308239,825,430229,809,0002,005,0002,117,632stderr
7Jul 4, 2026 22:5747,311239,884,612229,807,0002,020,0002,117,632stderr
8Jul 4, 2026 22:5747,376240,083,066231,141,0001,006,0002,117,632stderr
9Jul 4, 2026 22:5747,883243,969,934232,604,0002,027,0002,117,632stderr