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 11, 2026 22:44highload-churnerhighload-churnerScore: 27,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 22:4427,188142,259,553132,192,0001,030,0002,113,536
2Oct 11, 2026 22:4427,212142,346,799132,230,0001,112,0002,113,536
3Oct 11, 2026 22:4427,213142,355,584132,211,0001,134,0002,113,536
4Oct 11, 2026 22:4427,222142,421,890132,284,0001,107,0002,113,536
5Oct 11, 2026 22:4427,444143,507,454133,324,0001,152,0002,113,536
6Oct 11, 2026 22:4427,460143,555,225133,458,0001,096,0002,113,536
7Oct 11, 2026 22:4427,462143,553,055133,469,0001,098,0002,113,536
8Oct 11, 2026 22:4427,468143,573,145133,490,0001,105,0002,113,536
9Oct 11, 2026 22:4427,483143,640,237133,570,0001,100,0002,113,536