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:41highload-churnerhighload-churnerScore: 66,267Success
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 07:5266,220333,507,221323,364,0001,115,00020,480
2Oct 9, 2026 07:5266,233333,575,944323,481,0001,064,00020,480
3Oct 9, 2026 07:5266,236333,581,317323,477,0001,084,00020,480
4Oct 9, 2026 07:5266,249333,661,421323,572,0001,051,00020,480
5Oct 9, 2026 07:5266,267333,805,005323,569,0001,144,00020,480
6Oct 9, 2026 07:5266,585335,313,156325,193,0001,074,00020,480
7Oct 9, 2026 07:5266,605335,393,740325,236,0001,129,00020,480
8Oct 9, 2026 07:5266,635335,552,550325,392,0001,120,00020,480
9Oct 9, 2026 07:5269,197348,103,892338,002,0001,068,00020,480