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 22, 2026 05:35Victor MerckléVictor MerckléScore: 49,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 05:3649,296249,733,920239,469,0002,084,0002,113,536
2Jun 22, 2026 05:3649,358249,659,871239,793,0002,064,0002,113,536
3Jun 22, 2026 05:3649,360249,521,498239,841,0002,023,0002,113,536
4Jun 22, 2026 05:3649,365249,555,852239,827,0002,066,0002,113,536
5Jun 22, 2026 05:3649,440249,961,651240,237,0002,019,0002,113,536
6Jun 22, 2026 05:3649,563250,583,398240,810,0002,052,0002,113,536
7Jun 22, 2026 05:3649,577250,618,625240,890,0002,042,0002,113,536
8Jun 22, 2026 05:3649,990252,618,433242,851,0002,102,0002,113,536
9Jun 22, 2026 05:3650,982257,491,868247,737,0002,076,0002,113,536