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 15, 2026 13:34Tomislav TunkovicTomislav TunkovicScore: 34,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 13:3534,237176,009,582166,675,0001,090,0002,117,632
2Aug 15, 2026 13:3534,285176,190,805166,889,0001,108,0002,117,632
3Aug 15, 2026 13:3534,359176,921,492167,166,0001,197,0002,117,632
4Aug 15, 2026 13:3534,432177,074,595167,560,0001,160,0002,117,632
5Aug 15, 2026 13:3534,508178,072,082167,970,0001,123,0002,117,632
6Aug 15, 2026 13:3534,617178,096,997168,464,0001,164,0002,117,632
7Aug 15, 2026 13:3534,640177,976,064168,720,0001,018,0002,117,632
8Aug 15, 2026 13:3534,710178,503,060168,928,0001,153,0002,117,632
9Aug 15, 2026 13:3534,743178,424,230169,067,0001,175,0002,117,632