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 4, 2026 03:11zielajzielajScore: 24,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 03:1224,696129,033,808118,967,0002,046,0002,121,728stderr
2Jul 4, 2026 03:1224,743129,316,151119,220,0002,021,0002,121,728stderr
3Jul 4, 2026 03:1224,755129,323,789119,289,0002,012,0002,121,728stderr
4Jul 4, 2026 03:1224,780129,447,121119,375,0002,051,0002,121,728stderr
5Jul 4, 2026 03:1224,784129,553,964119,313,0002,133,0002,121,728stderr
6Jul 4, 2026 03:1224,787129,431,159119,420,0002,040,0002,121,728stderr
7Jul 4, 2026 03:1224,791129,412,725119,390,0002,088,0002,121,728stderr
8Jul 4, 2026 03:1224,833129,705,262119,604,0002,079,0002,121,728stderr
9Jul 4, 2026 03:1225,812134,523,110124,391,0002,090,0002,121,728stderr