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 12, 2026 05:08highload-churnerhighload-churnerScore: 24,952Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 05:0924,938131,256,271121,167,0001,031,0002,113,536
2Oct 12, 2026 05:0924,938131,128,600121,107,0001,091,0002,113,536
3Oct 12, 2026 05:0924,946131,304,833121,118,0001,118,0002,113,536
4Oct 12, 2026 05:0924,949131,270,008121,141,0001,113,0002,113,536
5Oct 12, 2026 05:0924,952131,291,801121,237,0001,031,0002,113,536
6Oct 12, 2026 05:0924,967131,331,941121,226,0001,113,0002,113,536
7Oct 12, 2026 05:0924,978131,367,028121,354,0001,039,0002,113,536
8Oct 12, 2026 05:0925,212132,524,411122,428,0001,112,0002,113,536
9Oct 12, 2026 05:0925,497133,968,607123,838,0001,099,0002,113,536