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 listOct 12, 2026 14:27highload-churnerhighload-churnerScore: 23,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:2823,783125,501,835115,506,0001,031,0002,113,536
2Oct 12, 2026 14:2823,788125,543,534115,456,0001,107,0002,113,536
3Oct 12, 2026 14:2823,797125,486,930115,503,0001,105,0002,113,536
4Oct 12, 2026 14:2823,797125,545,613115,575,0001,032,0002,113,536
5Oct 12, 2026 14:2823,798125,495,377115,582,0001,033,0002,113,536
6Oct 12, 2026 14:2823,798125,564,137115,588,0001,023,0002,113,536
7Oct 12, 2026 14:2823,799125,598,113115,520,0001,099,0002,113,536
8Oct 12, 2026 14:2823,811125,592,830115,614,0001,063,0002,113,536
9Oct 12, 2026 14:2823,818125,762,446115,556,0001,154,0002,113,536