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 listSep 26, 2026 17:56Kevin HeaveyKevin HeaveyScore: 24,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 17:5724,091126,732,353116,976,0001,072,00020,480
2Sep 26, 2026 17:5724,098126,678,632117,024,0001,058,00020,480
3Sep 26, 2026 17:5724,099126,749,958117,031,0001,058,00020,480
4Sep 26, 2026 17:5724,100128,370,666117,013,0001,080,00020,480
5Sep 26, 2026 17:5724,102126,653,692117,042,0001,059,00020,480
6Sep 26, 2026 17:5724,108126,778,815117,057,0001,077,00020,480
7Sep 26, 2026 17:5724,115126,841,451117,076,0001,091,00020,480
8Sep 26, 2026 17:5724,121126,958,648117,130,0001,065,00020,480
9Sep 26, 2026 17:5724,133126,729,761117,157,0001,098,00020,480