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 10:20wnwnScore: 111,527Success
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:22111,393556,791,896544,823,0001,003,0002,113,536
2May 11, 2026 10:22111,432554,773,132543,972,0002,045,0002,113,536
3May 11, 2026 10:22111,460556,643,411544,141,0002,013,0002,113,536
4May 11, 2026 10:22111,477558,185,036544,209,0002,033,0002,113,536
5May 11, 2026 10:22111,527556,790,648544,458,0002,029,0002,113,536
6May 11, 2026 10:22111,534555,283,883544,459,0002,060,0002,113,536
7May 11, 2026 10:22111,545557,865,157544,522,0002,050,0002,113,536
8May 11, 2026 10:22111,546555,315,814545,574,0001,004,0002,113,536
9May 11, 2026 10:22111,549557,607,315544,586,0002,006,0002,113,536