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 9, 2026 19:56Victor MerckléVictor MerckléScore: 32,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 19:5731,931164,376,166155,451,0001,011,0002,117,632stderr
2Jul 9, 2026 19:5732,033164,816,522155,953,0001,010,0002,117,632stderr
3Jul 9, 2026 19:5732,037164,825,002155,972,0001,012,0002,117,632stderr
4Jul 9, 2026 19:5732,103165,194,275156,298,0001,010,0002,117,632stderr
5Jul 9, 2026 19:5732,144165,373,486156,498,0001,011,0002,117,632stderr
6Jul 9, 2026 19:5732,188165,557,164156,712,0001,012,0002,117,632stderr
7Jul 9, 2026 19:5732,276166,004,829157,144,0001,011,0002,117,632stderr
8Jul 9, 2026 19:5732,382166,836,226157,662,0001,010,0002,117,632stderr
9Jul 9, 2026 19:5732,434166,861,919157,919,0001,010,0002,117,632stderr