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 18, 2026 01:38M-RochatM-RochatScore: 110,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:39110,632551,492,216540,939,0001,159,0002,113,536
2May 18, 2026 01:39110,666555,542,300541,066,0001,202,0002,113,536
3May 18, 2026 01:39110,704554,160,496541,300,0001,150,0002,113,536
4May 18, 2026 01:39110,765553,196,294541,611,0001,141,0002,113,536
5May 18, 2026 01:39110,800553,893,119541,776,0001,145,0002,113,536
6May 18, 2026 01:39111,155554,809,548543,501,0001,159,0002,113,536
7May 18, 2026 01:39112,939562,757,907552,256,0001,147,0002,113,536
8May 18, 2026 01:39114,027570,169,429557,548,0001,189,0002,113,536
9May 18, 2026 01:39114,081571,055,820557,817,0001,180,0002,113,536