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 3, 2026 12:38Victor MerckléVictor MerckléScore: 27,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:4727,054142,195,568131,552,0001,014,0002,117,632stderr
2Sep 3, 2026 12:4727,064141,442,608131,588,0001,026,0002,117,632stderr
3Sep 3, 2026 12:4727,074141,133,546131,564,0001,100,0002,117,632stderr
4Sep 3, 2026 12:4727,076141,109,840131,573,0001,100,0002,117,632stderr
5Sep 3, 2026 12:4727,078141,448,524131,578,0001,107,0002,117,632stderr
6Sep 3, 2026 12:4727,083141,181,463131,620,0001,088,0002,117,632stderr
7Sep 3, 2026 12:4727,084141,187,203131,606,0001,110,0002,117,632stderr
8Sep 3, 2026 12:4727,088141,140,832131,638,0001,098,0002,117,632stderr
9Sep 3, 2026 12:4727,099141,221,600131,639,0001,148,0002,117,632stderr