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 09:57highload-churnerhighload-churnerScore: 57,007Success
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 09:5956,802287,284,873277,278,0001,052,00020,480
2Oct 9, 2026 09:5956,803287,252,116277,277,0001,059,00020,480
3Oct 9, 2026 09:5956,906287,860,379277,763,0001,078,00020,480
4Oct 9, 2026 09:5956,990288,136,007278,183,0001,068,00020,480
5Oct 9, 2026 09:5957,007288,853,429278,267,0001,071,00020,480
6Oct 9, 2026 09:5957,013288,311,682278,309,0001,055,00020,480
7Oct 9, 2026 09:5957,168289,043,692279,051,0001,077,00020,480
8Oct 9, 2026 09:5959,404300,037,531290,026,0001,057,00020,480
9Oct 9, 2026 09:5959,490300,507,430290,450,0001,055,00020,480