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 4, 2026 03:19Josu San MartinJosu San MartinScore: 28,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 03:1928,061147,953,288136,239,0001,264,0002,113,536
2Aug 4, 2026 03:1928,064145,929,835136,241,0001,277,0002,113,536
3Aug 4, 2026 03:1928,078146,071,804136,320,0001,267,0002,113,536
4Aug 4, 2026 03:1928,083146,029,902136,341,0001,267,0002,113,536
5Aug 4, 2026 03:1928,116146,324,669136,500,0001,272,0002,113,536
6Aug 4, 2026 03:1928,120146,199,892136,531,0001,260,0002,113,536
7Aug 4, 2026 03:1928,198147,272,734136,922,0001,252,0002,113,536
8Aug 4, 2026 03:1928,219147,213,140137,013,0001,261,0002,113,536
9Aug 4, 2026 03:1929,663153,753,536144,092,0001,258,0002,113,536