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 listJul 31, 2026 20:56anboto1anboto1Score: 219,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 20:57218,1661,079,689,0081,067,938,0001,080,0002,113,536
2Jul 31, 2026 20:57218,6111,082,065,3771,070,122,0001,073,0002,113,536
3Jul 31, 2026 20:57218,7611,082,695,0911,070,842,0001,091,0002,113,536
4Jul 31, 2026 20:57219,1321,084,410,9681,072,673,0001,078,0002,113,536
5Jul 31, 2026 20:57219,1531,083,817,9111,072,766,0001,086,0002,113,536
6Jul 31, 2026 20:57219,1931,084,004,8451,072,967,0001,081,0002,113,536
7Jul 31, 2026 20:57219,6871,086,341,4091,075,389,0001,080,0002,113,536
8Jul 31, 2026 20:57219,9681,088,638,3251,076,755,0001,090,0002,113,536
9Jul 31, 2026 20:57220,2361,089,616,2181,078,083,0001,074,0002,113,536