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 15:41M-RochatM-RochatScore: 114,305Success
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 15:43114,004568,514,104557,462,0001,161,0002,113,536
2May 20, 2026 15:43114,018569,506,155557,531,0001,160,0002,113,536
3May 20, 2026 15:43114,132569,703,361558,120,0001,128,0002,113,536
4May 20, 2026 15:43114,273570,398,629558,824,0001,117,0002,113,536
5May 20, 2026 15:43114,305571,361,275558,963,0001,133,0002,113,536
6May 20, 2026 15:43114,318571,291,693558,992,0001,167,0002,113,536
7May 20, 2026 15:43114,415571,020,452559,512,0001,124,0002,113,536
8May 20, 2026 15:43122,215608,378,002597,728,0001,128,0002,113,536
9May 20, 2026 15:43137,982686,887,065674,993,0001,122,0002,113,536