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:34highload-churnerhighload-churnerScore: 53,298Success
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:0953,218269,654,691247,037,00013,734,00020,480
2Oct 9, 2026 22:0953,263270,131,278247,004,00013,986,00020,480
3Oct 9, 2026 22:0953,273271,365,911246,563,00014,477,00020,480
4Oct 9, 2026 22:0953,285270,436,858246,855,00014,245,00020,480
5Oct 9, 2026 22:0953,298270,134,795246,737,00014,428,00020,480
6Oct 9, 2026 22:0953,340270,367,242246,580,00014,786,00020,480
7Oct 9, 2026 22:0953,357270,451,514246,475,00014,976,00020,480
8Oct 9, 2026 22:0953,406271,280,914247,345,00014,346,00020,480
9Oct 9, 2026 22:0953,473270,955,640247,361,00014,658,00020,480