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 08:15wnwnScore: 111,312Success
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 08:16111,141553,821,768541,409,0003,183,0002,113,536
2May 11, 2026 08:16111,207554,078,549541,716,0003,201,0002,113,536
3May 11, 2026 08:16111,244555,608,750541,978,0003,119,0002,113,536
4May 11, 2026 08:16111,292554,581,677542,099,0003,236,0002,113,536
5May 11, 2026 08:16111,312556,060,687542,419,0003,010,0002,113,536
6May 11, 2026 08:16111,347555,092,165542,583,0003,019,0002,113,536
7May 11, 2026 08:16112,055559,469,498545,938,0003,133,0002,113,536
8May 11, 2026 08:16112,733562,775,518549,268,0003,124,0002,113,536
9May 11, 2026 08:16113,391567,313,289552,399,0003,219,0002,113,536