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 21:11Victor MerckléVictor MerckléScore: 25,716Success
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 21:1125,678134,305,749124,797,0001,029,0002,117,632stderr
2Sep 3, 2026 21:1125,714134,483,010124,902,0001,099,0002,117,632stderr
3Sep 3, 2026 21:1125,716134,452,477124,915,0001,094,0002,117,632stderr
4Sep 3, 2026 21:1125,716134,406,755124,894,0001,115,0002,117,632stderr
5Sep 3, 2026 21:1125,716134,461,179124,907,0001,104,0002,117,632stderr
6Sep 3, 2026 21:1125,725134,638,672124,943,0001,113,0002,117,632stderr
7Sep 3, 2026 21:1125,725134,556,596124,953,0001,100,0002,117,632stderr
8Sep 3, 2026 21:1125,727134,525,030124,976,0001,091,0002,117,632stderr
9Sep 3, 2026 21:1125,739134,537,282125,039,0001,083,0002,117,632stderr