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 14:29Victor MerckléVictor MerckléScore: 47,021Success
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 14:3046,792237,683,934227,229,0002,053,0002,117,632stderr
2Jul 4, 2026 14:3046,886237,834,915227,653,0002,093,0002,117,632stderr
3Jul 4, 2026 14:3046,896237,799,895227,697,0002,098,0002,117,632stderr
4Jul 4, 2026 14:3047,020238,420,461228,352,0002,047,0002,117,632stderr
5Jul 4, 2026 14:3047,021238,365,387228,366,0002,038,0002,117,632stderr
6Jul 4, 2026 14:3047,034238,435,202228,417,0002,050,0002,117,632stderr
7Jul 4, 2026 14:3047,407240,263,130230,173,0002,122,0002,117,632stderr
8Jul 4, 2026 14:3048,464245,448,112235,460,0002,018,0002,117,632stderr
9Jul 4, 2026 14:3048,483245,584,633235,513,0002,054,0002,117,632stderr