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 3, 2026 21:38anboto1anboto1Score: 57,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:4057,544290,480,795280,875,0001,091,0002,113,536
2Aug 3, 2026 21:4057,611290,762,946281,191,0001,103,0002,113,536
3Aug 3, 2026 21:4057,631290,812,574281,309,0001,087,0002,113,536
4Aug 3, 2026 21:4057,648290,979,566281,368,0001,108,0002,113,536
5Aug 3, 2026 21:4057,782293,026,036282,055,0001,081,0002,113,536
6Aug 3, 2026 21:4057,975292,556,314282,930,0001,149,0002,113,536
7Aug 3, 2026 21:4057,991292,533,126283,069,0001,090,0002,113,536
8Aug 3, 2026 21:4058,294294,067,148284,541,0001,102,0002,113,536
9Aug 3, 2026 21:4059,117298,138,284288,412,0001,265,0002,113,536