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 07:56highload-churnerhighload-churnerScore: 87,013Success
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 08:1584,607432,498,097413,446,0001,132,00020,480
2Oct 9, 2026 08:1584,700424,076,560414,030,0001,002,00020,480
3Oct 9, 2026 08:1585,731429,123,611418,960,0001,123,00020,480
4Oct 9, 2026 08:1586,835434,479,276424,491,0001,003,00020,480
5Oct 9, 2026 08:1587,013444,601,114425,357,0001,007,00020,480
6Oct 9, 2026 08:1587,235446,304,579426,315,0001,138,00020,480
7Oct 9, 2026 08:1587,278445,334,438426,501,0001,164,00020,480
8Oct 9, 2026 08:1587,280446,299,882426,667,0001,009,00020,480
9Oct 9, 2026 08:1587,370447,114,023427,000,0001,114,00020,480