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 4, 2026 15:58Victor MerckléVictor MerckléScore: 96,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:5996,068478,719,205468,667,0002,067,0002,117,632stderr
2Jul 4, 2026 15:5996,075478,736,831468,695,0002,076,0002,117,632stderr
3Jul 4, 2026 15:5996,093478,872,594468,676,0002,183,0002,117,632stderr
4Jul 4, 2026 15:5996,102478,860,770468,884,0002,016,0002,117,632stderr
5Jul 4, 2026 15:5996,238479,583,309469,451,0002,120,0002,117,632stderr
6Jul 4, 2026 15:5996,247479,711,043469,571,0002,044,0002,117,632stderr
7Jul 4, 2026 15:5996,251481,023,306469,546,0002,085,0002,117,632stderr
8Jul 4, 2026 15:5998,209489,228,733479,183,0002,042,0002,117,632stderr
9Jul 4, 2026 15:5998,487491,458,402480,408,0002,180,0002,117,632stderr