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 2, 2026 15:05Josu San MartinJosu San MartinScore: 31,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:0631,314163,601,722152,347,0001,093,0002,113,536
2Aug 2, 2026 15:0631,328163,485,155152,395,0001,114,0002,113,536
3Aug 2, 2026 15:0631,350163,566,707152,505,0001,110,0002,113,536
4Aug 2, 2026 15:0631,373163,754,150152,601,0001,130,0002,113,536
5Aug 2, 2026 15:0631,379163,748,240152,624,0001,135,0002,113,536
6Aug 2, 2026 15:0631,384163,849,244152,658,0001,124,0002,113,536
7Aug 2, 2026 15:0631,389164,094,552152,693,0001,115,0002,113,536
8Aug 2, 2026 15:0632,341168,506,836157,348,0001,127,0002,113,536
9Aug 2, 2026 15:0633,081172,410,099160,976,0001,123,0002,113,536