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:32Josu San MartinJosu San MartinScore: 86,136Success
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:3286,071448,766,449419,749,0001,998,0002,269,184
2Jan 23, 2026 16:3286,099449,737,199419,884,0001,999,0002,269,184
3Jan 23, 2026 16:3286,133447,842,973420,052,0002,000,0002,392,064
4Jan 23, 2026 16:3286,134444,692,066421,057,0001,000,0002,269,184
5Jan 23, 2026 16:3286,136449,460,083419,065,0003,000,0002,273,280
6Jan 23, 2026 16:3286,142449,656,471421,094,0001,000,0002,404,352
7Jan 23, 2026 16:3286,162448,634,779422,196,00002,269,184
8Jan 23, 2026 16:3286,174446,269,848420,252,0002,001,0002,269,184
9Jan 23, 2026 16:3286,231461,493,733417,537,0004,994,0002,392,064