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 11:29highload-churnerhighload-churnerScore: 55,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 11:3055,651281,703,168271,630,0001,062,00020,480
2Oct 9, 2026 11:3055,717281,916,510271,948,0001,070,00020,480
3Oct 9, 2026 11:3055,765282,354,244272,245,0001,006,00020,480
4Oct 9, 2026 11:3055,776282,267,813272,249,0001,057,00020,480
5Oct 9, 2026 11:3055,786282,333,244272,298,0001,058,00020,480
6Oct 9, 2026 11:3055,824282,665,918272,467,0001,074,00020,480
7Oct 9, 2026 11:3055,832283,010,337272,522,0001,058,00020,480
8Oct 9, 2026 11:3055,890282,801,173272,799,0001,063,00020,480
9Oct 9, 2026 11:3056,406285,285,001275,380,0001,010,00020,480