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 16:15highload-churnerhighload-churnerScore: 59,671Success
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 16:3159,522300,662,388290,579,0001,081,00020,480
2Oct 9, 2026 16:3159,589300,921,726290,936,0001,053,00020,480
3Oct 9, 2026 16:3159,632301,121,989291,194,0001,004,00020,480
4Oct 9, 2026 16:3159,641301,071,267291,117,0001,127,00020,480
5Oct 9, 2026 16:3159,671301,348,962291,338,0001,053,00020,480
6Oct 9, 2026 16:3159,702301,462,903291,476,0001,068,00020,480
7Oct 9, 2026 16:3159,707301,499,013291,503,0001,064,00020,480
8Oct 9, 2026 16:3159,774301,822,178291,758,0001,139,00020,480
9Oct 9, 2026 16:3159,813302,119,374291,958,0001,130,00020,480