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 22:03Josu San MartinJosu San MartinScore: 37,729Success
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 22:0837,702194,847,663183,624,0001,119,0002,113,536
2Jul 31, 2026 22:0837,703196,098,628183,626,0001,122,0002,113,536
3Jul 31, 2026 22:0837,708194,905,310183,659,0001,115,0002,113,536
4Jul 31, 2026 22:0837,715195,115,056183,676,0001,129,0002,113,536
5Jul 31, 2026 22:0837,729195,848,284183,745,0001,130,0002,113,536
6Jul 31, 2026 22:0837,746195,914,806183,836,0001,124,0002,113,536
7Jul 31, 2026 22:0838,212197,353,914186,125,0001,115,0002,113,536
8Jul 31, 2026 22:0838,641200,217,523188,202,0001,142,0002,113,536
9Jul 31, 2026 22:0838,642199,430,676188,200,0001,149,0002,113,536