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 10, 2026 00:34Victor MerckléVictor MerckléScore: 35,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:3535,311180,960,932170,938,0002,087,0002,117,632stderr
2Jul 10, 2026 00:3535,569182,401,870172,277,0002,014,0002,117,632stderr
3Jul 10, 2026 00:3535,723183,162,895172,983,0002,062,0002,117,632stderr
4Jul 10, 2026 00:3535,759183,379,017173,121,0002,100,0002,117,632stderr
5Jul 10, 2026 00:3535,777183,383,665173,048,0002,261,0002,117,632stderr
6Jul 10, 2026 00:3535,793183,221,576173,238,0002,149,0002,117,632stderr
7Jul 10, 2026 00:3535,823183,490,323173,515,0002,018,0002,117,632stderr
8Jul 10, 2026 00:3535,951184,096,576174,025,0002,135,0002,117,632stderr
9Jul 10, 2026 00:3536,018184,632,018174,465,0002,027,0002,117,632stderr