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:21Tomislav TunkovicTomislav TunkovicScore: 61,317Success
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:2260,825306,483,273296,926,0001,118,0002,117,632
2Aug 13, 2026 15:2260,872306,816,834297,079,0001,197,0002,117,632
3Aug 13, 2026 15:2261,152308,311,503298,480,0001,168,0002,117,632
4Aug 13, 2026 15:2261,242308,483,928298,921,0001,165,0002,117,632
5Aug 13, 2026 15:2261,317310,394,296299,238,0001,219,0002,117,632
6Aug 13, 2026 15:2261,376309,891,464299,566,0001,178,0002,117,632
7Aug 13, 2026 15:2261,408309,414,291299,732,0001,169,0002,117,632
8Aug 13, 2026 15:2261,471309,808,284299,958,0001,253,0002,117,632
9Aug 13, 2026 15:2261,680310,767,240301,034,0001,201,0002,117,632