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 11:13highload-churnerhighload-churnerScore: 55,814Success
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 11:1455,636281,511,538271,492,0001,129,00020,480
2Oct 9, 2026 11:1455,688282,429,856271,814,0001,062,00020,480
3Oct 9, 2026 11:1455,799283,753,188272,350,0001,067,00020,480
4Oct 9, 2026 11:1455,812282,448,186272,402,0001,078,00020,480
5Oct 9, 2026 11:1455,814282,521,647272,421,0001,069,00020,480
6Oct 9, 2026 11:1455,815282,375,525272,437,0001,061,00020,480
7Oct 9, 2026 11:1455,835282,601,533272,515,0001,079,00020,480
8Oct 9, 2026 11:1455,929283,610,132272,965,0001,089,00020,480
9Oct 9, 2026 11:1456,393285,301,589275,264,0001,063,00020,480