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 4, 2026 13:14Josu San MartinJosu San MartinScore: 25,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 13:1425,921136,005,801125,754,0001,263,0002,113,536
2Aug 4, 2026 13:1425,926137,713,431125,780,0001,258,0002,113,536
3Aug 4, 2026 13:1425,932135,455,903125,795,0001,273,0002,113,536
4Aug 4, 2026 13:1425,933135,516,714125,816,0001,260,0002,113,536
5Aug 4, 2026 13:1425,934136,131,158126,058,0001,022,0002,113,536
6Aug 4, 2026 13:1425,950135,740,041125,891,0001,266,0002,113,536
7Aug 4, 2026 13:1425,956135,566,112125,922,0001,265,0002,113,536
8Aug 4, 2026 13:1426,008136,446,166126,161,0001,279,0002,113,536
9Aug 4, 2026 13:1427,517144,475,709133,557,0001,277,0002,113,536