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 listJul 3, 2026 07:21Victor MerckléVictor MerckléScore: 47,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 07:2447,590241,131,332231,179,0002,013,0002,117,632stderr
2Jul 3, 2026 07:2447,613241,278,096231,227,0002,077,0002,117,632stderr
3Jul 3, 2026 07:2447,614241,277,459231,296,0002,014,0002,117,632stderr
4Jul 3, 2026 07:2447,616241,298,866231,292,0002,030,0002,117,632stderr
5Jul 3, 2026 07:2447,628241,315,624231,317,0002,061,0002,117,632stderr
6Jul 3, 2026 07:2447,640241,400,403231,422,0002,015,0002,117,632stderr
7Jul 3, 2026 07:2447,658241,499,550231,483,0002,042,0002,117,632stderr
8Jul 3, 2026 07:2447,667241,467,825231,560,0002,010,0002,117,632stderr
9Jul 3, 2026 07:2451,177258,750,998248,673,0002,095,0002,117,632stderr