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 23:40highload-churnerhighload-churnerScore: 49,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:2249,039249,213,570239,182,0001,110,00020,480
2Oct 10, 2026 01:2249,049249,305,336239,228,0001,115,00020,480
3Oct 10, 2026 01:2249,055249,339,523239,356,0001,014,00020,480
4Oct 10, 2026 01:2249,058249,541,776239,273,0001,114,00020,480
5Oct 10, 2026 01:2249,100249,524,139239,353,0001,237,00020,480
6Oct 10, 2026 01:2249,126249,685,675239,292,0001,430,00020,480
7Oct 10, 2026 01:2249,184250,019,297239,635,0001,368,00020,480
8Oct 10, 2026 01:2249,299250,505,563240,338,0001,229,00020,480
9Oct 10, 2026 01:2249,664252,111,980242,122,0001,235,00020,480