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 11:18Victor MerckléVictor MerckléScore: 25,761Success
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 11:1925,748134,590,377125,068,0001,100,0002,117,632stderr
2Sep 2, 2026 11:1925,755135,290,057125,094,0001,106,0002,117,632stderr
3Sep 2, 2026 11:1925,756134,665,158125,109,0001,096,0002,117,632stderr
4Sep 2, 2026 11:1925,757134,697,693125,123,0001,089,0002,117,632stderr
5Sep 2, 2026 11:1925,761134,659,217125,077,0001,154,0002,117,632stderr
6Sep 2, 2026 11:1925,762134,680,629125,142,0001,093,0002,117,632stderr
7Sep 2, 2026 11:1925,767135,373,512125,165,0001,096,0002,117,632stderr
8Sep 2, 2026 11:1925,771134,703,087125,179,0001,100,0002,117,632stderr
9Sep 2, 2026 11:1925,771134,680,936125,179,0001,101,0002,117,632stderr