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 16, 2026 21:12M-RochatM-RochatScore: 127,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 21:14125,909627,216,491614,888,0002,070,0002,113,536
2May 16, 2026 21:14126,003628,230,565615,347,0002,068,0002,113,536
3May 16, 2026 21:14126,409628,633,991617,325,0002,082,0002,113,536
4May 16, 2026 21:14126,839630,808,901619,437,0002,077,0002,113,536
5May 16, 2026 21:14127,397634,695,403622,060,0002,189,0002,113,536
6May 16, 2026 21:14127,704636,558,044623,690,0002,062,0002,113,536
7May 16, 2026 21:14128,004636,315,791625,190,0002,034,0002,113,536
8May 16, 2026 21:14128,525640,527,089627,699,0002,078,0002,113,536
9May 16, 2026 21:14128,697639,819,999628,611,0002,007,0002,113,536