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 22, 2026 20:32M-RochatM-RochatScore: 115,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:33111,842559,085,906546,896,0001,134,0002,113,536
2May 22, 2026 20:33113,210566,958,988553,578,0001,154,0002,113,536
3May 22, 2026 20:33114,024568,727,443557,576,0001,142,0002,113,536
4May 22, 2026 20:33114,991574,138,619562,322,0001,138,0002,113,536
5May 22, 2026 20:33115,032575,793,804562,510,0001,148,0002,113,536
6May 22, 2026 20:33115,320574,638,678563,938,0001,134,0002,113,536
7May 22, 2026 20:33115,895579,991,838566,739,0001,147,0002,113,536
8May 22, 2026 20:33116,928584,323,470571,821,0001,127,0002,113,536
9May 22, 2026 20:33117,984590,567,607576,977,0001,149,0002,113,536