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 20, 2026 16:05M-RochatM-RochatScore: 110,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:06110,474551,955,185540,200,0001,127,0002,113,536
2May 20, 2026 16:06110,476554,201,872540,187,0001,149,0002,113,536
3May 20, 2026 16:06110,485552,359,338540,243,0001,138,0002,113,536
4May 20, 2026 16:06110,489552,836,775540,266,0001,131,0002,113,536
5May 20, 2026 16:06110,570553,641,359540,666,0001,128,0002,113,536
6May 20, 2026 16:06111,011556,835,943542,812,0001,142,0002,113,536
7May 20, 2026 16:06113,749568,001,813556,254,0001,120,0002,113,536
8May 20, 2026 16:06113,773567,690,706556,349,0001,143,0002,113,536
9May 20, 2026 16:06114,154570,885,082558,214,0001,144,0002,113,536