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 11:57Victor MerckléVictor MerckléScore: 52,049Success
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 11:5851,989266,274,542252,567,0002,180,0002,113,536
2Jun 18, 2026 11:5851,991262,419,817252,680,0002,079,0002,113,536
3Jun 18, 2026 11:5851,997262,439,026252,610,0002,180,0002,113,536
4Jun 18, 2026 11:5852,044262,642,082252,958,0002,062,0002,113,536
5Jun 18, 2026 11:5852,049262,685,427253,028,0002,013,0002,113,536
6Jun 18, 2026 11:5852,071262,810,407253,131,0002,019,0002,113,536
7Jun 18, 2026 11:5852,081262,909,190253,180,0002,019,0002,113,536
8Jun 18, 2026 11:5852,096262,849,044253,235,0002,037,0002,113,536
9Jun 18, 2026 11:5852,619265,439,553255,771,0002,064,0002,113,536