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 18:35Victor MerckléVictor MerckléScore: 25,530Success
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 18:3525,501133,465,448123,912,0001,045,0002,117,632stderr
2Sep 3, 2026 18:3525,519133,525,934123,950,0001,096,0002,117,632stderr
3Sep 3, 2026 18:3525,522133,509,871123,963,0001,096,0002,117,632stderr
4Sep 3, 2026 18:3525,525134,700,588123,978,0001,095,0002,117,632stderr
5Sep 3, 2026 18:3525,530133,647,459123,995,0001,105,0002,117,632stderr
6Sep 3, 2026 18:3525,531134,731,718124,000,0001,106,0002,117,632stderr
7Sep 3, 2026 18:3525,546133,625,665124,074,0001,106,0002,117,632stderr
8Sep 3, 2026 18:3525,548133,672,074124,022,0001,164,0002,117,632stderr
9Sep 3, 2026 18:3525,556133,969,921124,107,0001,118,0002,117,632stderr