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 18, 2026 19:45Victor MerckléVictor MerckléScore: 54,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 19:4554,086272,644,610263,012,0002,013,0002,113,536
2Jun 18, 2026 19:4554,137272,977,419263,187,0002,089,0002,113,536
3Jun 18, 2026 19:4554,246273,530,316263,755,0002,055,0002,113,536
4Jun 18, 2026 19:4554,274273,535,461263,904,0002,039,0002,113,536
5Jun 18, 2026 19:4554,285273,629,788263,960,0002,039,0002,113,536
6Jun 18, 2026 19:4554,298273,699,871263,984,0002,078,0002,113,536
7Jun 18, 2026 19:4554,379274,109,397264,421,0002,038,0002,113,536
8Jun 18, 2026 19:4554,393274,404,379264,490,0002,039,0002,113,536
9Jun 18, 2026 19:4554,462274,759,894264,833,0002,034,0002,113,536