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 11, 2026 11:11highload-churnerhighload-churnerScore: 30,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 11:1230,598158,990,052148,816,0001,117,0002,113,536
2Oct 11, 2026 11:1230,601158,931,796148,849,0001,096,0002,113,536
3Oct 11, 2026 11:1230,603158,960,172148,804,0001,155,0002,113,536
4Oct 11, 2026 11:1230,613158,994,719148,910,0001,098,0002,113,536
5Oct 11, 2026 11:1230,626158,974,788148,902,0001,169,0002,113,536
6Oct 11, 2026 11:1231,240162,723,614152,043,0001,033,0002,113,536
7Oct 11, 2026 11:1232,303167,223,967157,160,0001,127,0002,113,536
8Oct 11, 2026 11:1232,305167,292,729157,159,0001,139,0002,113,536
9Oct 11, 2026 11:1232,516168,282,444158,235,0001,096,0002,113,536