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 13, 2026 07:41highload-churnerhighload-churnerScore: 22,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 07:4122,859121,043,197110,947,0001,065,00020,480
2Oct 13, 2026 07:4122,863121,011,614110,972,0001,057,00020,480
3Oct 13, 2026 07:4122,864121,045,097110,944,0001,091,00020,480
4Oct 13, 2026 07:4122,864121,030,433110,969,0001,066,00020,480
5Oct 13, 2026 07:4122,865121,038,652110,962,0001,078,00020,480
6Oct 13, 2026 07:4122,870121,044,534110,999,0001,064,00020,480
7Oct 13, 2026 07:4122,872121,101,719110,989,0001,087,00020,480
8Oct 13, 2026 07:4122,890121,239,871111,005,0001,158,00020,480
9Oct 13, 2026 07:4122,897121,182,560111,068,0001,130,00020,480