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 5, 2026 22:03Victor MerckléVictor MerckléScore: 58,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 22:0557,999293,314,106282,093,0002,106,0002,113,536
2Jun 5, 2026 22:0558,038293,681,209282,144,0002,245,0002,113,536
3Jun 5, 2026 22:0558,062294,017,948282,376,0002,129,0002,113,536
4Jun 5, 2026 22:0558,095293,877,209282,499,0002,169,0002,113,536
5Jun 5, 2026 22:0558,110295,137,648282,506,0002,236,0002,113,536
6Jun 5, 2026 22:0558,111293,941,096282,561,0002,184,0002,113,536
7Jun 5, 2026 22:0558,159294,215,474282,805,0002,176,0002,113,536
8Jun 5, 2026 22:0558,246294,608,539283,228,0002,179,0002,113,536
9Jun 5, 2026 22:0558,253294,589,837283,205,0002,239,0002,113,536