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 listAug 24, 2026 19:39Victor MerckléVictor MerckléScore: 28,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:4028,404147,600,686137,164,0002,020,0002,117,632stderr
2Aug 24, 2026 19:4028,419147,690,985137,209,0002,048,0002,117,632stderr
3Aug 24, 2026 19:4028,548148,354,780137,862,0002,027,0002,117,632stderr
4Aug 24, 2026 19:4028,575148,412,434138,001,0002,017,0002,117,632stderr
5Aug 24, 2026 19:4028,576148,418,591137,992,0002,035,0002,117,632stderr
6Aug 24, 2026 19:4028,595148,964,114138,090,0002,030,0002,117,632stderr
7Aug 24, 2026 19:4028,634148,665,090139,300,0001,010,0002,117,632stderr
8Aug 24, 2026 19:4028,694149,028,558139,594,0001,010,0002,117,632stderr
9Aug 24, 2026 19:4029,428152,585,147142,176,0002,026,0002,117,632stderr