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: 115,880Success
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:40112,363559,565,810549,525,0001,058,00020,480
2Oct 9, 2026 07:40112,395559,714,148549,670,0001,068,00020,480
3Oct 9, 2026 07:40114,512570,111,828559,970,0001,141,00020,480
4Oct 9, 2026 07:40115,866576,742,927566,688,0001,060,00020,480
5Oct 9, 2026 07:40115,880576,789,765566,679,0001,137,00020,480
6Oct 9, 2026 07:40115,881576,841,236566,762,0001,057,00020,480
7Oct 9, 2026 07:40115,996579,522,075567,374,0001,007,00020,480
8Oct 9, 2026 07:40116,006577,514,813567,342,0001,091,00020,480
9Oct 9, 2026 07:40189,030935,272,041925,152,0001,098,00020,480