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 listJun 13, 2026 03:55Victor MerckléVictor MerckléScore: 54,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 03:5754,109274,499,589262,087,0003,048,0002,138,112
2Jun 13, 2026 03:5754,109274,032,651262,103,0003,035,0002,138,112
3Jun 13, 2026 03:5754,117274,237,939262,124,0003,053,0002,138,112
4Jun 13, 2026 03:5754,119276,896,580262,165,0003,019,0002,138,112
5Jun 13, 2026 03:5754,126274,171,870263,201,0002,018,0002,138,112
6Jun 13, 2026 03:5754,138274,178,927262,264,0003,013,0002,138,112
7Jun 13, 2026 03:5754,138274,401,349262,258,0003,023,0002,138,112
8Jun 13, 2026 03:5754,140274,136,529263,279,0002,011,0002,138,112
9Jun 13, 2026 03:5754,150274,288,910263,320,0002,015,0002,138,112