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 3, 2026 15:38Josu San MartinJosu San MartinScore: 30,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 15:3830,234157,237,106146,880,0001,268,0002,113,536
2Aug 3, 2026 15:3830,236157,286,823146,900,0001,260,0002,113,536
3Aug 3, 2026 15:3830,238157,305,033146,917,0001,251,0002,113,536
4Aug 3, 2026 15:3830,242157,315,719147,181,0001,006,0002,113,536
5Aug 3, 2026 15:3830,244157,334,999146,945,0001,254,0002,113,536
6Aug 3, 2026 15:3830,776159,927,344149,760,0001,043,0002,113,536
7Aug 3, 2026 15:3830,991161,018,330150,585,0001,273,0002,113,536
8Aug 3, 2026 15:3831,066161,322,126151,112,0001,116,0002,113,536
9Aug 3, 2026 15:3831,101161,492,227151,357,0001,038,0002,113,536