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 29, 2026 03:19Josu San MartinJosu San MartinScore: 24,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:1924,203127,031,898117,339,0001,260,0002,113,536
2Aug 29, 2026 03:1924,204127,267,224117,353,0001,250,0002,113,536
3Aug 29, 2026 03:1924,204127,016,677117,344,0001,260,0002,113,536
4Aug 29, 2026 03:1924,204127,011,010117,335,0001,267,0002,113,536
5Aug 29, 2026 03:1924,206127,041,517117,358,0001,252,0002,113,536
6Aug 29, 2026 03:1924,206128,147,138117,343,0001,269,0002,113,536
7Aug 29, 2026 03:1924,209127,023,952117,371,0001,257,0002,113,536
8Aug 29, 2026 03:1924,226127,085,068117,449,0001,260,0002,113,536
9Aug 29, 2026 03:1924,578129,230,990119,162,0001,275,0002,113,536