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 2, 2026 05:47Victor MerckléVictor MerckléScore: 26,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 05:4726,989140,678,780131,134,0001,113,0002,117,632stderr
2Sep 2, 2026 05:4726,992140,674,751131,171,0001,094,0002,117,632stderr
3Sep 2, 2026 05:4726,992140,664,497131,176,0001,085,0002,117,632stderr
4Sep 2, 2026 05:4726,994140,673,355131,168,0001,106,0002,117,632stderr
5Sep 2, 2026 05:4726,996141,169,542131,162,0001,120,0002,117,632stderr
6Sep 2, 2026 05:4726,999140,732,376131,199,0001,098,0002,117,632stderr
7Sep 2, 2026 05:4727,000140,815,793131,199,0001,104,0002,117,632stderr
8Sep 2, 2026 05:4727,003140,773,563131,205,0001,114,0002,117,632stderr
9Sep 2, 2026 05:4727,005141,255,219131,187,0001,141,0002,117,632stderr