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 4, 2026 00:10Victor MerckléVictor MerckléScore: 47,265Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 00:1147,221239,846,727230,358,0001,025,0002,117,632stderr
2Sep 4, 2026 00:1147,250240,068,793230,418,0001,107,0002,117,632stderr
3Sep 4, 2026 00:1147,254241,253,579230,434,0001,115,0002,117,632stderr
4Sep 4, 2026 00:1147,261240,082,712230,472,0001,110,0002,117,632stderr
5Sep 4, 2026 00:1147,265240,120,149230,485,0001,117,0002,117,632stderr
6Sep 4, 2026 00:1147,265240,127,859230,584,0001,017,0002,117,632stderr
7Sep 4, 2026 00:1147,266240,192,525230,429,0001,176,0002,117,632stderr
8Sep 4, 2026 00:1147,267240,121,075230,450,0001,163,0002,117,632stderr
9Sep 4, 2026 00:1147,268240,120,752230,420,0001,196,0002,117,632stderr