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 listJul 31, 2026 20:55Josu San MartinJosu San MartinScore: 38,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 20:5538,366198,925,242186,880,0001,118,0002,113,536
2Jul 31, 2026 20:5538,367198,036,767186,906,0001,094,0002,113,536
3Jul 31, 2026 20:5538,372198,921,098186,891,0001,133,0002,113,536
4Jul 31, 2026 20:5538,376198,205,573186,936,0001,109,0002,113,536
5Jul 31, 2026 20:5538,381198,983,425186,929,0001,139,0002,113,536
6Jul 31, 2026 20:5538,381198,984,880186,928,0001,140,0002,113,536
7Jul 31, 2026 20:5538,384198,164,109186,955,0001,130,0002,113,536
8Jul 31, 2026 20:5538,550199,011,665187,784,0001,112,0002,113,536
9Jul 31, 2026 20:5538,577199,175,103187,924,0001,107,0002,113,536