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:14Josu San MartinJosu San MartinScore: 27,163Success
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:1527,062140,832,470131,598,0001,008,0002,113,536
2Aug 4, 2026 03:1527,066140,753,469131,447,0001,181,0002,113,536
3Aug 4, 2026 03:1527,098141,880,357131,769,0001,012,0002,113,536
4Aug 4, 2026 03:1527,108141,964,001131,570,0001,262,0002,113,536
5Aug 4, 2026 03:1527,163141,635,179131,849,0001,250,0002,113,536
6Aug 4, 2026 03:1527,185141,630,918131,956,0001,255,0002,113,536
7Aug 4, 2026 03:1527,294142,158,745132,492,0001,250,0002,113,536
8Aug 4, 2026 03:1527,336142,343,772132,691,0001,259,0002,113,536
9Aug 4, 2026 03:1528,018145,903,430136,259,0001,034,0002,113,536