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 12:25Josu San MartinJosu San MartinScore: 29,205Success
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 12:2529,186151,677,286141,753,0001,263,0002,113,536
2Aug 3, 2026 12:2529,192152,167,131141,781,0001,262,0002,113,536
3Aug 3, 2026 12:2529,195152,098,882141,791,0001,267,0002,113,536
4Aug 3, 2026 12:2529,203152,240,848141,837,0001,260,0002,117,632
5Aug 3, 2026 12:2529,205151,294,968142,102,0001,006,0002,113,536
6Aug 3, 2026 12:2529,206152,168,374141,857,0001,255,0002,113,536
7Aug 3, 2026 12:2529,211152,275,526141,864,0001,273,0002,113,536
8Aug 3, 2026 12:2529,304152,744,404142,317,0001,275,0002,113,536
9Aug 3, 2026 12:2529,315151,916,086142,581,0001,066,0002,113,536