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 16:27Victor MerckléVictor MerckléScore: 26,601Success
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 16:2826,594142,018,884129,210,0001,101,0002,117,632stderr
2Sep 3, 2026 16:2826,597139,468,682129,237,0001,092,0002,117,632stderr
3Sep 3, 2026 16:2826,598138,824,737129,232,0001,099,0002,117,632stderr
4Sep 3, 2026 16:2826,600138,725,370129,246,0001,097,0002,117,632stderr
5Sep 3, 2026 16:2826,601140,019,587129,247,0001,100,0002,117,632stderr
6Sep 3, 2026 16:2826,603138,767,928129,262,0001,093,0002,117,632stderr
7Sep 3, 2026 16:2826,604139,965,606129,238,0001,124,0002,117,632stderr
8Sep 3, 2026 16:2826,606143,558,970129,270,0001,102,0002,117,632stderr
9Sep 3, 2026 16:2826,653139,409,853129,586,0001,017,0002,117,632stderr