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 3, 2026 18:32Josu San MartinJosu San MartinScore: 28,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 18:3328,186147,274,974136,850,0001,266,0002,113,536
2Aug 3, 2026 18:3328,191146,553,185136,873,0001,267,0002,113,536
3Aug 3, 2026 18:3328,196146,589,879136,889,0001,273,0002,113,536
4Aug 3, 2026 18:3328,198147,354,977136,913,0001,258,0002,113,536
5Aug 3, 2026 18:3328,203146,718,562136,928,0001,267,0002,113,536
6Aug 3, 2026 18:3328,213147,369,128136,994,0001,254,0002,113,536
7Aug 3, 2026 18:3328,442147,951,295138,354,0001,012,0002,113,536
8Aug 3, 2026 18:3328,450148,481,974138,359,0001,049,0002,113,536
9Aug 3, 2026 18:3328,712149,845,346139,427,0001,262,0002,113,536