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 19, 2026 03:42Victor MerckléVictor MerckléScore: 49,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 03:4349,380249,661,285239,932,0002,032,0002,113,536
2Jun 19, 2026 03:4349,520250,269,079240,637,0002,012,0002,113,536
3Jun 19, 2026 03:4349,690251,103,581241,475,0002,007,0002,113,536
4Jun 19, 2026 03:4349,741251,308,718241,712,0002,021,0002,113,536
5Jun 19, 2026 03:4349,761251,213,378241,765,0002,067,0002,113,536
6Jun 19, 2026 03:4349,823251,721,588242,128,0002,007,0002,113,536
7Jun 19, 2026 03:4349,825251,693,745242,101,0002,043,0002,113,536
8Jun 19, 2026 03:4349,915252,251,044242,526,0002,060,0002,113,536
9Jun 19, 2026 03:4349,946252,348,560242,681,0002,057,0002,113,536