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 listAug 1, 2026 12:20Josu San MartinJosu San MartinScore: 35,058Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:2135,039181,753,472170,596,0001,099,0002,113,536
2Aug 1, 2026 12:2135,048181,811,470170,615,0001,121,0002,113,536
3Aug 1, 2026 12:2135,048181,745,238170,636,0001,101,0002,113,536
4Aug 1, 2026 12:2135,057181,840,634170,668,0001,112,0002,113,536
5Aug 1, 2026 12:2135,058181,881,265170,682,0001,104,0002,113,536
6Aug 1, 2026 12:2135,061181,846,632170,673,0001,126,0002,113,536
7Aug 1, 2026 12:2135,069182,726,419170,697,0001,143,0002,113,536
8Aug 1, 2026 12:2135,075182,072,957170,751,0001,120,0002,113,536
9Aug 1, 2026 12:2136,910191,827,845179,739,0001,123,0002,113,536