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 9, 2026 23:17highload-churnerhighload-churnerScore: 48,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:5848,619247,276,492237,102,0001,132,00020,480
2Oct 10, 2026 00:5848,623247,259,182237,183,0001,070,00020,480
3Oct 10, 2026 00:5848,626247,496,214237,205,0001,063,00020,480
4Oct 10, 2026 00:5848,633247,340,200237,236,0001,069,00020,480
5Oct 10, 2026 00:5848,641247,359,406237,260,0001,081,00020,480
6Oct 10, 2026 00:5848,646247,353,916237,319,0001,048,00020,480
7Oct 10, 2026 00:5848,663247,484,930237,445,0001,007,00020,480
8Oct 10, 2026 00:5848,664247,401,073237,372,0001,082,00020,480
9Oct 10, 2026 00:5848,673247,440,131237,356,0001,142,00020,480