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 3, 2026 22:06Victor MerckléVictor MerckléScore: 25,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:0725,539133,563,320124,129,0001,016,0002,117,632stderr
2Sep 3, 2026 22:0725,548133,632,875124,164,0001,026,0002,117,632stderr
3Sep 3, 2026 22:0725,582135,079,470124,256,0001,098,0002,117,632stderr
4Sep 3, 2026 22:0725,600133,981,823124,350,0001,091,0002,117,632stderr
5Sep 3, 2026 22:0725,603133,895,422124,359,0001,098,0002,117,632stderr
6Sep 3, 2026 22:0725,608133,989,159124,366,0001,115,0002,117,632stderr
7Sep 3, 2026 22:0725,610133,967,181124,403,0001,089,0002,117,632stderr
8Sep 3, 2026 22:0725,620134,420,682124,441,0001,098,0002,117,632stderr
9Sep 3, 2026 22:0725,657137,378,466124,457,0001,265,0002,117,632stderr