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 listMar 8, 2026 18:34Josu San MartinJosu San MartinScore: 91,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 18:2988,362462,100,760430,974,0001,999,0002,396,160
2Mar 8, 2026 18:2988,363457,812,163430,982,0001,999,0002,269,184
3Mar 8, 2026 18:2988,416456,758,980431,237,0002,001,0002,396,160
4Mar 8, 2026 19:3491,883472,409,432448,227,0002,001,0002,265,088
5Mar 8, 2026 19:3491,909472,670,159449,355,0001,000,0002,519,040
6Mar 8, 2026 18:3491,941481,185,764448,516,0001,997,0002,265,088
7Mar 8, 2026 18:3492,067477,204,824450,129,0001,000,0002,404,352
8Mar 8, 2026 19:3492,068475,865,962448,132,0003,000,0002,265,088
9Mar 8, 2026 18:3492,092479,615,636450,251,0001,000,0002,400,256