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 07:56highload-churnerhighload-churnerScore: 71,900Success
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 08:1671,835360,971,318350,923,0001,070,00020,480
2Oct 9, 2026 08:1671,857370,644,109350,991,0001,113,00020,480
3Oct 9, 2026 08:1671,866361,232,044350,975,0001,172,00020,480
4Oct 9, 2026 08:1671,889369,552,009351,145,0001,113,00020,480
5Oct 9, 2026 08:1671,900370,509,271351,161,0001,152,00020,480
6Oct 9, 2026 08:1671,910370,090,180351,350,0001,010,00020,480
7Oct 9, 2026 08:1672,664371,721,921354,945,0001,111,00020,480
8Oct 9, 2026 08:1672,668372,615,975354,883,0001,193,00020,480
9Oct 9, 2026 08:1672,724374,847,496355,247,0001,103,00020,480