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 13:09wnwnScore: 110,715Success
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 13:11110,658551,823,976541,074,0001,154,0002,113,536
2May 11, 2026 13:11110,686551,586,576541,269,0001,095,0002,113,536
3May 11, 2026 13:11110,687554,508,941541,144,0001,227,0002,113,536
4May 11, 2026 13:11110,703551,215,594541,278,0001,167,0002,113,536
5May 11, 2026 13:11110,715552,967,116541,344,0001,160,0002,113,536
6May 11, 2026 13:11110,737553,325,466541,478,0001,135,0002,113,536
7May 11, 2026 13:11111,706559,023,923546,235,0001,125,0002,113,536
8May 11, 2026 13:11111,708558,269,040546,169,0001,201,0002,113,536
9May 11, 2026 13:11111,730557,943,109546,397,0001,083,0002,113,536