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 4, 2026 10:12Victor MerckléVictor MerckléScore: 25,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 10:1525,055131,163,902121,758,0001,012,0002,117,632stderr
2Sep 4, 2026 10:1525,078131,348,548121,861,0001,024,0002,117,632stderr
3Sep 4, 2026 10:1525,092131,759,790121,866,0001,088,0002,117,632stderr
4Sep 4, 2026 10:1525,093131,413,233121,859,0001,099,0002,117,632stderr
5Sep 4, 2026 10:1525,100131,406,720121,897,0001,094,0002,117,632stderr
6Sep 4, 2026 10:1525,105131,401,954121,922,0001,094,0002,117,632stderr
7Sep 4, 2026 10:1525,109131,552,429121,981,0001,054,0002,117,632stderr
8Sep 4, 2026 10:1525,113131,497,553121,951,0001,104,0002,117,632stderr
9Sep 4, 2026 10:1525,123131,556,768121,983,0001,124,0002,117,632stderr