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 2, 2026 23:35Josu San MartinJosu San MartinScore: 29,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 23:3629,674154,479,014144,401,0001,005,0002,113,536
2Aug 2, 2026 23:3629,675153,888,113144,401,0001,008,0002,113,536
3Aug 2, 2026 23:3629,678153,828,278144,417,0001,007,0002,113,536
4Aug 2, 2026 23:3629,684153,879,654144,443,0001,012,0002,113,536
5Aug 2, 2026 23:3629,686155,282,981144,430,0001,036,0002,113,536
6Aug 2, 2026 23:3629,688153,913,721144,454,0001,020,0002,113,536
7Aug 2, 2026 23:3629,703154,647,252144,535,0001,014,0002,113,536
8Aug 2, 2026 23:3629,843154,708,319145,215,0001,016,0002,113,536
9Aug 2, 2026 23:3630,192156,429,940145,933,0002,012,0002,113,536