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 listSep 2, 2026 08:46Victor MerckléVictor MerckléScore: 26,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 08:4726,468138,142,116128,596,0001,098,0002,117,632stderr
2Sep 2, 2026 08:4726,469138,136,055128,611,0001,089,0002,117,632stderr
3Sep 2, 2026 08:4726,471138,103,969128,617,0001,093,0002,117,632stderr
4Sep 2, 2026 08:4726,471138,134,655128,618,0001,094,0002,117,632stderr
5Sep 2, 2026 08:4726,472139,389,949128,590,0001,124,0002,117,632stderr
6Sep 2, 2026 08:4726,478138,211,992128,641,0001,104,0002,117,632stderr
7Sep 2, 2026 08:4726,478138,147,189128,640,0001,104,0002,117,632stderr
8Sep 2, 2026 08:4726,482138,883,878128,617,0001,148,0002,117,632stderr
9Sep 2, 2026 08:4726,492138,206,506128,679,0001,134,0002,117,632stderr