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 21:20anboto1anboto1Score: 153,510Success
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 21:23153,288761,627,641749,867,0001,245,0002,113,536
2Jul 31, 2026 21:23153,383762,028,107750,339,0001,240,0002,113,536
3Jul 31, 2026 21:23153,468762,231,864750,744,0001,250,0002,113,536
4Jul 31, 2026 21:23153,493762,306,393750,878,0001,239,0002,113,536
5Jul 31, 2026 21:23153,510762,401,769750,942,0001,259,0002,113,536
6Jul 31, 2026 21:23153,520763,752,258751,018,0001,232,0002,113,536
7Jul 31, 2026 21:23153,865764,086,114752,689,0001,253,0002,113,536
8Jul 31, 2026 21:23153,909764,318,072752,925,0001,231,0002,113,536
9Jul 31, 2026 21:23153,927764,418,172753,015,0001,231,0002,113,536