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 6, 2026 18:54Victor MerckléVictor MerckléScore: 58,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 18:5458,499295,891,933284,643,0002,006,0002,113,536
2Jun 6, 2026 18:5458,508295,858,490284,516,0002,178,0002,113,536
3Jun 6, 2026 18:5458,551296,040,754284,708,0002,192,0002,113,536
4Jun 6, 2026 18:5458,588296,318,847284,887,0002,195,0002,113,536
5Jun 6, 2026 18:5458,594296,315,879284,898,0002,214,0002,113,536
6Jun 6, 2026 18:5458,646296,496,849285,345,0002,022,0002,113,536
7Jun 6, 2026 18:5458,674296,715,345285,277,0002,229,0002,113,536
8Jun 6, 2026 18:5460,080303,563,491292,153,0002,243,0002,113,536
9Jun 6, 2026 18:5460,367304,915,309293,573,0002,226,0002,113,536