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 13, 2026 15:25Tomislav TunkovicTomislav TunkovicScore: 50,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 15:3050,544256,064,823246,585,0001,084,0002,117,632
2Aug 13, 2026 15:3050,621257,026,912246,869,0001,178,0002,117,632
3Aug 13, 2026 15:3050,635256,614,396246,940,0001,173,0002,117,632
4Aug 13, 2026 15:3050,641256,466,171246,963,0001,179,0002,117,632
5Aug 13, 2026 15:3050,650256,436,892246,978,0001,211,0002,117,632
6Aug 13, 2026 15:3050,651256,489,018247,030,0001,164,0002,117,632
7Aug 13, 2026 15:3050,658256,703,131247,221,0001,005,0002,117,632
8Aug 13, 2026 15:3050,781257,213,489247,613,0001,215,0002,117,632
9Aug 13, 2026 15:3050,804258,138,810247,758,0001,185,0002,117,632