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 08:44highload-churnerhighload-churnerScore: 61,688Success
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 09:4561,642311,055,305300,989,0001,061,00020,480
2Oct 9, 2026 09:4561,657311,149,192301,057,0001,065,00020,480
3Oct 9, 2026 09:4561,676311,171,989301,147,0001,070,00020,480
4Oct 9, 2026 09:4561,679311,199,939301,167,0001,061,00020,480
5Oct 9, 2026 09:4561,688312,939,589301,201,0001,072,00020,480
6Oct 9, 2026 09:4561,747311,481,108301,558,0001,003,00020,480
7Oct 9, 2026 09:4561,820311,993,234301,797,0001,125,00020,480
8Oct 9, 2026 09:4562,462315,122,316305,012,0001,056,00020,480
9Oct 9, 2026 09:4562,694316,255,242306,137,0001,064,00020,480