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 8, 2026 10:12Victor MerckléVictor MerckléScore: 31,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 10:1331,394162,083,356152,823,0001,010,0002,117,632stderr
2Jul 8, 2026 10:1331,541162,437,538153,545,0001,010,0002,117,632stderr
3Jul 8, 2026 10:1331,646162,913,819154,055,0001,012,0002,117,632stderr
4Jul 8, 2026 10:1331,709163,453,910154,366,0001,012,0002,117,632stderr
5Jul 8, 2026 10:1331,849163,893,173155,050,0001,012,0002,117,632stderr
6Jul 8, 2026 10:1331,856164,031,427155,082,0001,014,0002,117,632stderr
7Jul 8, 2026 10:1332,046165,152,677156,014,0001,013,0002,117,632stderr
8Jul 8, 2026 10:1332,097165,193,424156,266,0001,010,0002,117,632stderr
9Jul 8, 2026 10:1332,231165,854,954156,924,0001,010,0002,117,632stderr