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:43Andrew EpsteinAndrew EpsteinScore: 176,643Success
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:44176,603877,313,698864,234,0001,125,0002,117,632stderr
2Sep 25, 2026 04:44176,630876,068,578864,366,0001,124,0002,117,632stderr
3Sep 25, 2026 04:44176,631876,051,426864,385,0001,108,0002,117,632stderr
4Sep 25, 2026 04:44176,633876,338,498864,374,0001,129,0002,117,632stderr
5Sep 25, 2026 04:44176,643876,006,328864,442,0001,112,0002,117,632stderr
6Sep 25, 2026 04:44176,670876,307,446864,559,0001,125,0002,117,632stderr
7Sep 25, 2026 04:44176,675876,267,321864,584,0001,127,0002,117,632stderr
8Sep 25, 2026 04:44176,680876,350,441864,615,0001,121,0002,117,632stderr
9Sep 25, 2026 04:44176,715876,734,820863,717,0002,188,0002,117,632stderr