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 listSep 2, 2026 03:52Victor MerckléVictor MerckléScore: 28,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 03:5327,964145,813,481135,931,0001,095,0002,117,632stderr
2Sep 2, 2026 03:5327,971146,141,343135,957,0001,101,0002,117,632stderr
3Sep 2, 2026 03:5327,973145,762,228135,957,0001,111,0002,117,632stderr
4Sep 2, 2026 03:5328,232146,746,138137,232,0001,107,0002,117,632stderr
5Sep 2, 2026 03:5328,236146,784,531137,253,0001,108,0002,117,632stderr
6Sep 2, 2026 03:5328,240146,801,234137,289,0001,088,0002,117,632stderr
7Sep 2, 2026 03:5328,245146,800,740137,315,0001,087,0002,117,632stderr
8Sep 2, 2026 03:5328,263147,131,247137,303,0001,186,0002,117,632stderr
9Sep 2, 2026 03:5328,277146,936,608137,469,0001,091,0002,117,632stderr