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 17, 2026 13:42Victor MerckléVictor MerckléScore: 55,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 13:4355,509281,095,175269,766,0002,232,0002,113,536
2Jun 17, 2026 13:4355,559281,400,737270,222,0002,020,0002,113,536
3Jun 17, 2026 13:4355,564281,475,528270,213,0002,052,0002,113,536
4Jun 17, 2026 13:4355,566281,363,495270,039,0002,239,0002,113,536
5Jun 17, 2026 13:4355,596281,553,686270,416,0002,008,0002,113,536
6Jun 17, 2026 13:4355,603281,595,512270,216,0002,241,0002,113,536
7Jun 17, 2026 13:4355,636281,808,442270,608,0002,009,0002,113,536
8Jun 17, 2026 13:4355,638281,805,694270,367,0002,262,0002,113,536
9Jun 17, 2026 13:4355,691281,953,791270,860,0002,026,0002,113,536