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 listMay 11, 2026 16:28Victor MerckléVictor MerckléScore: 85,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:2984,850427,475,995413,760,0002,009,0002,113,536
2May 11, 2026 16:2984,911427,700,492413,904,0002,161,0002,113,536
3May 11, 2026 16:2984,952426,906,640414,059,0002,206,0002,113,536
4May 11, 2026 16:2984,955427,628,495414,065,0002,218,0002,113,536
5May 11, 2026 16:2985,034427,371,094414,575,0002,093,0002,113,536
6May 11, 2026 16:2985,047426,314,762414,601,0002,133,0002,113,536
7May 11, 2026 16:2985,079425,972,641414,668,0002,222,0002,113,536
8May 11, 2026 16:2987,666441,496,596427,525,0002,042,0002,113,536
9May 11, 2026 16:2988,363442,249,639431,976,0001,003,0002,113,536