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:40highload-churnerhighload-churnerScore: 51,654Success
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:2551,355269,633,321250,548,0001,093,00020,480
2Oct 9, 2026 22:2551,398269,760,363250,749,0001,106,00020,480
3Oct 9, 2026 22:2551,580261,696,335251,692,0001,050,00020,480
4Oct 9, 2026 22:2551,604261,668,734251,791,0001,070,00020,480
5Oct 9, 2026 22:2551,654262,080,427252,015,0001,090,00020,480
6Oct 9, 2026 22:2551,668264,896,491252,098,0001,077,00020,480
7Oct 9, 2026 22:2551,669262,182,098252,123,0001,057,00020,480
8Oct 9, 2026 22:2551,673262,281,733252,130,0001,068,00020,480
9Oct 9, 2026 22:2552,356265,474,735255,490,0001,055,00020,480