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 2, 2026 07:32A_ShamanA_ShamanScore: 189,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 07:32189,478938,454,788926,416,0002,031,0002,113,536
2Jul 2, 2026 07:32189,478938,082,337926,368,0002,078,0002,113,536
3Jul 2, 2026 07:32189,550938,883,755926,793,0002,006,0002,113,536
4Jul 2, 2026 07:32189,569938,478,156926,809,0002,082,0002,113,536
5Jul 2, 2026 07:32189,585939,029,099926,829,0002,141,0002,113,536
6Jul 2, 2026 07:32189,599939,104,873926,944,0002,094,0002,113,536
7Jul 2, 2026 07:32189,600938,711,308926,899,0002,142,0002,113,536
8Jul 2, 2026 07:32189,600938,745,563927,032,0002,008,0002,113,536
9Jul 2, 2026 07:32189,629939,017,160927,030,0002,153,0002,113,536