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 17:34highload-churnerhighload-churnerScore: 56,316Success
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 17:4056,122283,944,374273,929,0001,071,00020,480
2Oct 9, 2026 17:4056,222284,471,057274,427,0001,063,00020,480
3Oct 9, 2026 17:4056,238284,521,746274,509,0001,061,00020,480
4Oct 9, 2026 17:4056,272289,038,616274,651,0001,082,00020,480
5Oct 9, 2026 17:4056,316284,844,678274,893,0001,056,00020,480
6Oct 9, 2026 17:4056,345285,071,601275,008,0001,083,00020,480
7Oct 9, 2026 17:4056,382285,204,986275,204,0001,072,00020,480
8Oct 9, 2026 17:4056,382285,328,056275,167,0001,107,00020,480
9Oct 9, 2026 17:4063,953322,441,891312,249,0001,123,00020,480