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 00:57Josu San MartinJosu San MartinScore: 29,403Success
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 00:5729,377153,079,549142,688,0001,261,0002,113,536
2Aug 3, 2026 00:5729,382153,058,951142,701,0001,272,0002,113,536
3Aug 3, 2026 00:5729,396152,467,385143,039,0001,002,0002,113,536
4Aug 3, 2026 00:5729,402152,502,409142,803,0001,267,0002,113,536
5Aug 3, 2026 00:5729,403153,172,357142,813,0001,262,0002,113,536
6Aug 3, 2026 00:5729,407152,500,293142,828,0001,270,0002,113,536
7Aug 3, 2026 00:5729,408152,617,016143,096,0001,004,0002,113,536
8Aug 3, 2026 00:5729,793155,049,927144,985,0001,005,0002,113,536
9Aug 3, 2026 00:5732,611168,962,344158,517,0001,278,0002,113,536