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:32zielajzielajScore: 27,374Success
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:3327,274141,718,967131,604,0002,043,0002,121,728stderr
2Jul 4, 2026 03:3327,371142,105,560132,051,0002,071,0002,121,728stderr
3Jul 4, 2026 03:3327,374142,052,165132,025,0002,109,0002,121,728stderr
4Jul 4, 2026 03:3327,374142,138,992132,028,0002,109,0002,121,728stderr
5Jul 4, 2026 03:3327,374142,006,919132,030,0002,104,0002,121,728stderr
6Jul 4, 2026 03:3327,379142,209,814132,018,0002,140,0002,121,728stderr
7Jul 4, 2026 03:3327,386142,744,772132,108,0002,085,0002,121,728stderr
8Jul 4, 2026 03:3327,647143,871,001133,354,0002,118,0002,121,728stderr
9Jul 4, 2026 03:3327,847144,479,843134,397,0002,057,0002,121,728stderr