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 listAug 25, 2026 11:11Victor MerckléVictor MerckléScore: 43,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 11:1243,737223,361,763213,285,0001,027,0002,117,632stderr
2Aug 25, 2026 11:1243,783223,590,656213,440,0001,097,0002,117,632stderr
3Aug 25, 2026 11:1243,802223,713,231213,529,0001,103,0002,117,632stderr
4Aug 25, 2026 11:1243,803223,657,509213,534,0001,101,0002,117,632stderr
5Aug 25, 2026 11:1243,804223,689,412213,521,0001,121,0002,117,632stderr
6Aug 25, 2026 11:1243,809223,781,418213,554,0001,114,0002,117,632stderr
7Aug 25, 2026 11:1243,811223,702,647213,560,0001,115,0002,117,632stderr
8Aug 25, 2026 11:1243,814223,658,981213,597,0001,092,0002,117,632stderr
9Aug 25, 2026 11:1243,824223,815,340213,641,0001,100,0002,117,632stderr