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 4, 2026 03:52zielajzielajScore: 24,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 03:5324,386128,187,028117,429,0002,067,0002,121,728stderr
2Jul 4, 2026 03:5324,397127,767,783117,511,0002,038,0002,121,728stderr
3Jul 4, 2026 03:5324,401127,527,387117,459,0002,110,0002,121,728stderr
4Jul 4, 2026 03:5324,416128,046,164117,468,0002,172,0002,121,728stderr
5Jul 4, 2026 03:5324,440127,780,593117,622,0002,135,0002,121,728stderr
6Jul 4, 2026 03:5324,446127,721,508117,511,0002,279,0002,121,728stderr
7Jul 4, 2026 03:5325,367132,278,225122,164,0002,137,0002,121,728stderr
8Jul 4, 2026 03:5326,189136,364,445126,234,0002,095,0002,121,728stderr
9Jul 4, 2026 03:5326,210136,372,251126,380,0002,050,0002,121,728stderr