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 31, 2026 15:17Josu San MartinJosu San MartinScore: 70,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 15:1869,946352,837,110340,635,0002,101,0002,113,536
2Jul 31, 2026 15:1870,115353,698,152341,408,0002,156,0002,113,536
3Jul 31, 2026 15:1870,266354,388,632342,225,0002,082,0002,113,536
4Jul 31, 2026 15:1870,311354,696,852342,428,0002,099,0002,113,536
5Jul 31, 2026 15:1870,331354,688,093342,489,0002,133,0002,113,536
6Jul 31, 2026 15:1870,345354,793,999342,612,0002,081,0002,113,536
7Jul 31, 2026 15:1871,280359,410,006347,269,0002,007,0002,113,536
8Jul 31, 2026 15:1871,375361,154,431347,594,0002,146,0002,113,536
9Jul 31, 2026 15:1871,378360,601,776347,750,0002,007,0002,113,536