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:31highload-churnerhighload-churnerScore: 54,798Success
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:0754,355275,236,748252,434,00013,906,00020,480
2Oct 9, 2026 22:0754,365275,466,099252,272,00014,119,00020,480
3Oct 9, 2026 22:0754,551276,659,599252,515,00014,786,00020,480
4Oct 9, 2026 22:0754,766277,379,454252,323,00016,034,00020,480
5Oct 9, 2026 22:0754,798278,960,261252,212,00016,301,00020,480
6Oct 9, 2026 22:0754,817277,724,731252,188,00016,417,00020,480
7Oct 9, 2026 22:0755,097278,962,677254,889,00015,087,00020,480
8Oct 9, 2026 22:0756,539286,010,955262,582,00014,461,00020,480
9Oct 9, 2026 22:0758,381295,080,940271,426,00014,641,00020,480