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 11, 2026 09:54wnwnScore: 98,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 09:5598,690494,224,396481,515,0002,066,0002,113,536
2May 11, 2026 09:5598,698493,344,764481,575,0002,049,0002,113,536
3May 11, 2026 09:5598,706495,982,567481,639,0002,025,0002,113,536
4May 11, 2026 09:5598,729492,482,310482,771,0001,005,0002,113,536
5May 11, 2026 09:5598,772492,560,666482,981,0001,004,0002,113,536
6May 11, 2026 09:5599,179496,417,466484,977,0001,004,0002,113,536
7May 11, 2026 09:5599,210496,252,773484,127,0002,005,0002,113,536
8May 11, 2026 09:5599,264495,200,493485,393,0001,005,0002,113,536
9May 11, 2026 09:5599,341496,186,095484,692,0002,081,0002,113,536