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:59wnwnScore: 98,733Success
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 10:0298,694492,475,241481,517,0002,085,0002,113,536
2May 11, 2026 10:0298,697494,133,137481,567,0002,051,0002,113,536
3May 11, 2026 10:0298,699493,905,021481,565,0002,061,0002,113,536
4May 11, 2026 10:0298,717493,419,081481,673,0002,043,0002,113,536
5May 11, 2026 10:0298,733492,786,420481,740,0002,052,0002,113,536
6May 11, 2026 10:0298,734494,142,670481,747,0002,053,0002,117,632
7May 11, 2026 10:0298,749494,298,992482,866,0001,005,0002,113,536
8May 11, 2026 10:0299,246497,078,427485,305,0001,005,0002,113,536
9May 11, 2026 10:0299,329496,546,154484,661,0002,054,0002,113,536