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 18, 2026 01:09M-RochatM-RochatScore: 121,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:11118,529590,284,793579,652,0001,142,0002,113,536
2May 18, 2026 01:11119,062595,155,449582,276,0001,131,0002,113,536
3May 18, 2026 01:11119,182594,767,067582,863,0001,130,0002,113,536
4May 18, 2026 01:11120,049598,708,698587,087,0001,157,0002,113,536
5May 18, 2026 01:11121,652607,823,194594,946,0001,152,0002,113,536
6May 18, 2026 01:11121,977609,816,766596,539,0001,149,0002,113,536
7May 18, 2026 01:11122,074609,235,425597,035,0001,130,0002,113,536
8May 18, 2026 01:11122,240611,046,089597,846,0001,133,0002,113,536
9May 18, 2026 01:11124,742620,804,583610,106,0001,132,0002,113,536