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 14:41Victor MerckléVictor MerckléScore: 25,570Success
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 14:4225,547133,727,443124,163,0001,022,0002,117,632stderr
2Sep 3, 2026 14:4225,562134,220,868124,154,0001,100,0002,117,632stderr
3Sep 3, 2026 14:4225,567133,762,917124,160,0001,121,0002,117,632stderr
4Sep 3, 2026 14:4225,569133,795,484124,186,0001,104,0002,117,632stderr
5Sep 3, 2026 14:4225,570133,762,120124,207,0001,087,0002,117,632stderr
6Sep 3, 2026 14:4225,573133,787,910124,212,0001,098,0002,117,632stderr
7Sep 3, 2026 14:4225,576133,844,483124,204,0001,123,0002,117,632stderr
8Sep 3, 2026 14:4225,581133,838,576124,255,0001,092,0002,117,632stderr
9Sep 3, 2026 14:4225,597135,065,332124,158,0001,269,0002,117,632stderr