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 listJun 17, 2025 16:24Павел РатмановПавел РатмановScore: 319,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2025 16:24319,8701,593,073,7021,564,364,0002,998,0002,260,992
2Jun 17, 2025 16:24319,8721,593,427,1711,564,377,0002,998,0002,281,472
3Jun 17, 2025 16:24319,8811,593,808,3271,564,419,0002,998,0002,260,992
4Jun 17, 2025 16:24319,8861,592,551,3171,564,443,0002,998,0002,269,184
5Jun 17, 2025 16:24319,9041,595,105,9231,565,529,0001,999,0002,289,664
6Jun 17, 2025 16:24319,9181,594,939,9341,566,601,000999,0002,289,664
7Jun 17, 2025 16:24319,9381,600,182,6611,564,700,0002,997,0002,265,088
8Jun 17, 2025 16:24321,1821,605,913,9761,571,792,0001,999,0002,289,664
9Jun 17, 2025 16:24324,2771,617,597,6001,586,960,0001,998,0002,265,088