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 10:46highload-churnerhighload-churnerScore: 56,006Success
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 10:5255,843282,594,359272,579,0001,053,00020,480
2Oct 9, 2026 10:5255,894282,878,788272,808,0001,073,00020,480
3Oct 9, 2026 10:5256,002283,358,206273,361,0001,051,00020,480
4Oct 9, 2026 10:5256,002283,413,401273,340,0001,074,00020,480
5Oct 9, 2026 10:5256,006283,391,627273,354,0001,076,00020,480
6Oct 9, 2026 10:5256,100283,890,995273,888,0001,004,00020,480
7Oct 9, 2026 10:5256,104283,873,068273,843,0001,067,00020,480
8Oct 9, 2026 10:5256,161284,154,399274,127,0001,064,00020,480
9Oct 9, 2026 10:5256,646286,635,624276,497,0001,071,00020,480