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 21, 2026 16:57A_ShamanA_ShamanScore: 136,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 16:58136,781679,277,941668,153,0002,077,0002,113,536
2Jun 21, 2026 16:58136,843679,724,641668,460,0002,073,0002,113,536
3Jun 21, 2026 16:58136,861681,228,445668,589,0002,031,0002,113,536
4Jun 21, 2026 16:58136,905679,900,916668,759,0002,077,0002,113,536
5Jun 21, 2026 16:58136,907679,978,897668,733,0002,114,0002,113,536
6Jun 21, 2026 16:58136,913679,907,442668,762,0002,113,0002,113,536
7Jun 21, 2026 16:58136,936680,043,727668,948,0002,043,0002,113,536
8Jun 21, 2026 16:58136,973680,371,910669,043,0002,129,0002,113,536
9Jun 21, 2026 16:58137,006680,597,037669,176,0002,154,0002,113,536