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 13:25highload-churnerhighload-churnerScore: 23,374Success
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 13:2523,360123,432,193113,441,0001,023,0002,113,536
2Oct 12, 2026 13:2523,363123,589,619113,372,0001,110,0002,113,536
3Oct 12, 2026 13:2523,367123,489,763113,407,0001,095,0002,113,536
4Oct 12, 2026 13:2523,373123,913,114113,412,0001,120,0002,113,536
5Oct 12, 2026 13:2523,374123,554,285113,437,0001,100,0002,113,536
6Oct 12, 2026 13:2523,380123,572,006113,449,0001,114,0002,113,536
7Oct 12, 2026 13:2523,381123,578,385113,426,0001,144,0002,113,536
8Oct 12, 2026 13:2523,383123,588,571113,478,0001,099,0002,113,536
9Oct 12, 2026 13:2523,389125,057,629113,454,0001,154,0002,113,536