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 12, 2026 02:56Victor MerckléVictor MerckléScore: 53,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 02:5653,759272,516,976261,192,0002,228,0002,113,536
2Jun 12, 2026 02:5653,768272,638,883261,241,0002,224,0002,113,536
3Jun 12, 2026 02:5653,790272,712,338261,552,0002,022,0002,117,632
4Jun 12, 2026 02:5653,810272,687,007261,441,0002,229,0002,113,536
5Jun 12, 2026 02:5653,811272,747,095261,438,0002,237,0002,113,536
6Jun 12, 2026 02:5653,812273,219,554261,638,0002,042,0002,113,536
7Jun 12, 2026 02:5653,841273,332,158261,602,0002,221,0002,113,536
8Jun 12, 2026 02:5654,598276,698,062265,356,0002,179,0002,113,536
9Jun 12, 2026 02:5655,305280,308,466268,767,0002,228,0002,113,536