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 25, 2026 01:36Victor MerckléVictor MerckléScore: 29,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:3728,939150,187,308140,791,0001,011,0002,117,632stderr
2Aug 25, 2026 01:3729,017150,534,796141,175,0001,009,0002,117,632stderr
3Aug 25, 2026 01:3729,033150,737,074141,255,0001,010,0002,117,632stderr
4Aug 25, 2026 01:3729,120151,053,062140,594,0002,097,0002,117,632stderr
5Aug 25, 2026 01:3729,142151,204,026141,790,0001,008,0002,117,632stderr
6Aug 25, 2026 01:3729,179151,416,364141,972,0001,009,0002,117,632stderr
7Aug 25, 2026 01:3729,225151,632,153141,189,0002,015,0002,117,632stderr
8Aug 25, 2026 01:3729,287151,904,238141,501,0002,006,0002,117,632stderr
9Aug 25, 2026 01:3729,351152,296,237141,797,0002,027,0002,117,632stderr