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:19highload-churnerhighload-churnerScore: 61,150Success
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:1861,091308,327,093298,295,0001,054,00020,480
2Oct 9, 2026 09:1861,121308,474,525298,436,0001,061,00020,480
3Oct 9, 2026 09:1861,123308,472,717298,461,0001,046,00020,480
4Oct 9, 2026 09:1861,147308,673,410298,562,0001,063,00020,480
5Oct 9, 2026 09:1861,150308,929,172298,582,0001,056,00020,480
6Oct 9, 2026 09:1861,174308,773,947298,684,0001,073,00020,480
7Oct 9, 2026 09:1861,211308,804,002298,830,0001,105,00020,480
8Oct 9, 2026 09:1861,211308,911,659298,876,0001,061,00020,480
9Oct 9, 2026 09:1861,380309,746,188299,719,0001,043,00020,480