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 listMay 11, 2026 13:15wnwnScore: 98,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 13:1698,263491,336,069479,454,0002,037,0002,113,536
2May 11, 2026 13:1698,298490,739,181479,565,0002,097,0002,113,536
3May 11, 2026 13:1698,332490,853,221479,765,0002,062,0002,113,536
4May 11, 2026 13:1698,498512,980,806480,527,0002,118,0002,113,536
5May 11, 2026 13:1698,798493,823,605482,080,0002,034,0002,113,536
6May 11, 2026 13:1698,835493,124,541482,242,0002,053,0002,113,536
7May 11, 2026 13:1698,870493,189,552482,416,0002,047,0002,113,536
8May 11, 2026 13:1698,881494,333,620482,415,0002,104,0002,113,536
9May 11, 2026 13:1699,143496,711,485483,701,0002,104,0002,117,632