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 listAug 1, 2026 05:05anboto1anboto1Score: 125,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 05:06123,669616,085,848601,975,0004,005,0002,113,536
2Aug 1, 2026 05:06123,680617,013,274601,980,0004,054,0002,113,536
3Aug 1, 2026 05:06124,244619,075,058604,730,0004,068,0002,113,536
4Aug 1, 2026 05:06125,061622,886,562608,699,0004,104,0002,113,536
5Aug 1, 2026 05:06125,162623,399,471609,050,0004,245,0002,113,536
6Aug 1, 2026 05:06125,262623,860,446609,669,0004,118,0002,113,536
7Aug 1, 2026 05:06125,666626,708,143611,708,0004,057,0002,113,536
8Aug 1, 2026 05:06126,804632,061,197617,212,0004,129,0002,113,536
9Aug 1, 2026 05:06127,121632,945,247618,714,0004,182,0002,113,536