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:13anboto1anboto1Score: 162,936Success
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:14161,973803,523,966792,662,0001,007,0002,113,536
2Jul 31, 2026 20:14162,475806,166,719795,126,0001,002,0002,113,536
3Jul 31, 2026 20:14162,719809,928,102796,310,0001,017,0002,113,536
4Jul 31, 2026 20:14162,860808,021,237796,999,0001,019,0002,113,536
5Jul 31, 2026 20:14162,936808,465,212797,384,0001,004,0002,113,536
6Jul 31, 2026 20:14163,128809,238,511798,321,0001,007,0002,113,536
7Jul 31, 2026 20:14163,136809,502,861798,362,0001,008,0002,113,536
8Jul 31, 2026 20:14163,190809,598,279798,631,0001,004,0002,113,536
9Jul 31, 2026 20:14163,254810,719,414798,931,0001,015,0002,113,536