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:31highload-churnerhighload-churnerScore: 172,672Success
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 07:41169,135837,778,274827,706,0001,057,00020,480
2Oct 9, 2026 07:41169,521839,757,998829,513,0001,142,00020,480
3Oct 9, 2026 07:41170,856854,587,008836,095,0001,101,00020,480
4Oct 9, 2026 07:41171,440849,130,020838,924,0001,136,00020,480
5Oct 9, 2026 07:41172,672855,137,454844,993,0001,101,00020,480
6Oct 9, 2026 07:41173,099857,791,275847,145,0001,044,00020,480
7Oct 9, 2026 07:41173,109857,274,179847,108,0001,128,00020,480
8Oct 9, 2026 07:41173,139857,417,824847,302,0001,083,00020,480
9Oct 9, 2026 07:41173,223865,100,119847,795,0001,000,00020,480