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 listJan 23, 2026 16:35Josu San MartinJosu San MartinScore: 85,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 16:3585,786441,086,503419,352,0001,000,0002,396,160
2Jan 23, 2026 16:3585,804451,292,818418,440,0002,002,0002,269,184
3Jan 23, 2026 16:3585,863446,624,485418,733,0001,998,0002,269,184
4Jan 23, 2026 16:3585,873448,264,694417,778,0002,998,0002,396,160
5Jan 23, 2026 16:3585,893456,593,533415,879,0004,998,0002,269,184
6Jan 23, 2026 16:3585,900454,462,302418,913,0001,999,0002,269,184
7Jan 23, 2026 16:3585,917442,891,638418,992,0001,999,0002,510,848
8Jan 23, 2026 16:3585,919446,861,789419,003,0002,000,0002,269,184
9Jan 23, 2026 16:3586,160447,418,139420,183,0002,000,0002,269,184