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 19, 2026 18:48Victor MerckléVictor MerckléScore: 50,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 18:4950,788256,238,021246,836,0002,030,0002,113,536
2Jun 19, 2026 18:4950,837257,056,453247,087,0002,017,0002,113,536
3Jun 19, 2026 18:4950,873256,909,756247,179,0002,100,0002,113,536
4Jun 19, 2026 18:4950,879256,988,872247,261,0002,050,0002,113,536
5Jun 19, 2026 18:4950,914257,371,052247,434,0002,046,0002,113,536
6Jun 19, 2026 18:4950,936257,026,434247,564,0002,027,0002,113,536
7Jun 19, 2026 18:4951,197258,429,358248,798,0002,068,0002,113,536
8Jun 19, 2026 18:4952,037262,568,676252,942,0002,043,0002,113,536
9Jun 19, 2026 18:4952,483264,832,651255,147,0002,024,0002,113,536