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 25, 2026 04:44Andrew EpsteinAndrew EpsteinScore: 177,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 04:45177,896882,701,517870,689,0001,003,0002,117,632stderr
2Sep 25, 2026 04:45177,908882,048,152870,739,0001,013,0002,117,632stderr
3Sep 25, 2026 04:45177,923883,120,977870,802,0001,022,0002,117,632stderr
4Sep 25, 2026 04:45177,924882,513,964870,824,0001,005,0002,117,632stderr
5Sep 25, 2026 04:45177,930882,875,336870,859,0001,002,0002,117,632stderr
6Sep 25, 2026 04:45177,947883,036,902870,941,0001,001,0002,117,632stderr
7Sep 25, 2026 04:45177,983882,448,187871,106,0001,011,0002,117,632stderr
8Sep 25, 2026 04:45178,271884,682,568872,526,0001,003,0002,117,632stderr
9Sep 25, 2026 04:45178,322884,203,940872,778,0001,002,0002,117,632stderr