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 listApr 4, 2026 05:04limanjun99limanjun99Score: 119,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 05:04119,450617,069,176584,304,0001,000,0002,293,760
2Apr 4, 2026 05:04119,559614,638,626582,841,0002,999,0002,273,280
3Apr 4, 2026 05:04119,586620,530,861584,974,000999,0002,371,584
4Apr 4, 2026 05:04119,629610,619,059584,180,0002,000,0002,289,664
5Apr 4, 2026 05:04119,641611,184,673583,244,0002,996,0002,293,760
6Apr 4, 2026 05:04119,677609,889,824584,419,0001,998,0002,293,760
7Apr 4, 2026 05:04119,684614,545,225583,456,0002,997,0002,293,760
8Apr 4, 2026 05:04119,767611,380,408583,860,0002,999,0002,293,760
9Apr 4, 2026 05:04120,026619,793,120586,126,0002,000,0002,269,184