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:07zielajzielajScore: 24,779Success
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:0824,698129,337,344118,964,0002,061,0002,121,728stderr
2Jul 4, 2026 03:0824,708129,337,573119,024,0002,048,0002,121,728stderr
3Jul 4, 2026 03:0824,739129,180,507119,167,0002,055,0002,121,728stderr
4Jul 4, 2026 03:0824,775129,371,410119,262,0002,136,0002,121,728stderr
5Jul 4, 2026 03:0824,779129,370,832119,411,0002,010,0002,121,728stderr
6Jul 4, 2026 03:0824,799129,530,511119,462,0002,055,0002,121,728stderr
7Jul 4, 2026 03:0824,801129,603,158119,454,0002,075,0002,121,728stderr
8Jul 4, 2026 03:0825,751134,226,633124,019,0002,162,0002,121,728stderr
9Jul 4, 2026 03:0825,856134,658,330124,643,0002,054,0002,121,728stderr