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 1, 2026 00:09Victor MerckléVictor MerckléScore: 65,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 00:1065,160327,159,019317,239,0002,047,0002,117,632stderr
2Jul 1, 2026 00:1065,162327,139,313317,248,0002,046,0002,117,632stderr
3Jul 1, 2026 00:1065,175327,269,251317,306,0002,054,0002,117,632stderr
4Jul 1, 2026 00:1065,180327,326,199317,298,0002,088,0002,117,632stderr
5Jul 1, 2026 00:1065,187327,212,349317,335,0002,084,0002,117,632stderr
6Jul 1, 2026 00:1065,190327,479,837317,410,0002,021,0002,117,632stderr
7Jul 1, 2026 00:1065,246327,682,640317,562,0002,147,0002,117,632stderr
8Jul 1, 2026 00:1065,257327,712,969317,709,0002,054,0002,117,632stderr
9Jul 1, 2026 00:1065,319327,991,010318,044,0002,022,0002,117,632stderr