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:35highload-churnerhighload-churnerScore: 52,764Success
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:1152,670266,915,521244,036,00014,051,00020,480
2Oct 9, 2026 22:1152,706267,245,307244,360,00013,901,00020,480
3Oct 9, 2026 22:1152,723267,337,976244,679,00013,665,00020,480
4Oct 9, 2026 22:1152,744267,325,805244,196,00014,253,00020,480
5Oct 9, 2026 22:1152,764267,543,007244,380,00014,167,00020,480
6Oct 9, 2026 22:1152,821267,744,522244,742,00014,084,00020,480
7Oct 9, 2026 22:1152,886268,802,333244,191,00014,953,00020,480
8Oct 9, 2026 22:1152,949268,354,469244,422,00015,029,00020,480
9Oct 9, 2026 22:1152,966268,554,408244,200,00015,336,00020,480