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 19:14anboto1anboto1Score: 151,988Success
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 19:15151,842754,006,112742,964,0001,062,0002,113,536
2Jul 31, 2026 19:15151,883754,258,337743,140,0001,087,0002,113,536
3Jul 31, 2026 19:15151,927754,893,747743,384,0001,063,0002,113,536
4Jul 31, 2026 19:15151,976754,788,632742,602,0002,081,0002,113,536
5Jul 31, 2026 19:15151,988754,673,215743,665,0001,079,0002,113,536
6Jul 31, 2026 19:15152,038755,083,912743,908,0001,082,0002,113,536
7Jul 31, 2026 19:15152,071755,117,212744,071,0001,081,0002,113,536
8Jul 31, 2026 19:15152,092755,237,274744,172,0001,082,0002,113,536
9Jul 31, 2026 19:15152,110755,358,767744,264,0001,078,0002,113,536