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 11:36wnwnScore: 129,393Success
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 11:37127,025635,050,835619,396,0003,031,0002,113,536
2May 11, 2026 11:37127,068632,825,930619,448,0003,188,0002,113,536
3May 11, 2026 11:37127,202633,779,969620,029,0003,263,0002,113,536
4May 11, 2026 11:37129,309642,334,096630,529,0003,089,0002,113,536
5May 11, 2026 11:37129,393642,793,595630,766,0003,264,0002,113,536
6May 11, 2026 11:37129,767644,799,851632,688,0003,171,0002,113,536
7May 11, 2026 11:37129,804647,280,585632,980,0003,062,0002,113,536
8May 11, 2026 11:37132,686659,002,274647,157,0003,008,0002,113,536
9May 11, 2026 11:37132,776660,040,015645,589,0005,017,0002,113,536