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 21:48highload-churnerhighload-churnerScore: 51,543Success
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 22:4251,490261,396,501251,236,0001,067,00020,480
2Oct 9, 2026 22:4251,491261,293,300251,238,0001,069,00020,480
3Oct 9, 2026 22:4251,513261,415,889251,367,0001,050,00020,480
4Oct 9, 2026 22:4251,519261,490,268251,324,0001,122,00020,480
5Oct 9, 2026 22:4251,543261,521,878251,504,0001,061,00020,480
6Oct 9, 2026 22:4251,552261,628,415251,449,0001,157,00020,480
7Oct 9, 2026 22:4251,574261,704,102251,659,0001,054,00020,480
8Oct 9, 2026 22:4251,646262,145,696252,021,0001,049,00020,480
9Oct 9, 2026 22:4254,204274,424,223264,495,0001,106,00020,480