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 2, 2026 17:14anboto1anboto1Score: 62,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:1562,904318,448,592307,130,0001,103,0002,113,536
2Aug 2, 2026 17:1562,937318,476,414307,278,0001,115,0002,113,536
3Aug 2, 2026 17:1562,952318,505,467307,356,0001,113,0002,113,536
4Aug 2, 2026 17:1562,981318,689,747307,487,0001,123,0002,113,536
5Aug 2, 2026 17:1562,982318,681,676307,485,0001,127,0002,113,536
6Aug 2, 2026 17:1563,024328,601,026307,623,0001,199,0002,113,536
7Aug 2, 2026 17:1563,100328,767,093308,003,0001,190,0002,113,536
8Aug 2, 2026 17:1563,282334,641,193308,856,0001,229,0002,113,536
9Aug 2, 2026 17:1564,231324,742,287313,611,0001,121,0002,113,536