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 18:54Victor MerckléVictor MerckléScore: 28,655Success
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 18:5428,323147,170,781136,767,0002,016,0002,117,632stderr
2Aug 24, 2026 18:5428,401147,572,040137,125,0002,044,0002,117,632stderr
3Aug 24, 2026 18:5428,456147,839,802138,425,0001,010,0002,117,632stderr
4Aug 24, 2026 18:5428,637148,779,799138,317,0002,007,0002,117,632stderr
5Aug 24, 2026 18:5428,655148,790,501139,401,0001,010,0002,117,632stderr
6Aug 24, 2026 18:5428,688148,958,767138,540,0002,032,0002,117,632stderr
7Aug 24, 2026 18:5428,732148,978,894138,747,0002,041,0002,117,632stderr
8Aug 24, 2026 18:5428,774149,435,909138,965,0002,030,0002,117,632stderr
9Aug 24, 2026 18:5428,804150,405,347140,134,0001,010,0002,117,632stderr