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 4, 2026 23:43Victor MerckléVictor MerckléScore: 63,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 23:4463,147318,559,291307,301,0002,123,0002,113,536
2Jun 4, 2026 23:4463,198318,851,757307,609,0002,066,0002,113,536
3Jun 4, 2026 23:4463,201319,930,148307,625,0002,062,0002,113,536
4Jun 4, 2026 23:4463,202318,815,174307,611,0002,079,0002,113,536
5Jun 4, 2026 23:4463,213318,965,541307,703,0002,044,0002,113,536
6Jun 4, 2026 23:4463,218318,914,065307,723,0002,049,0002,113,536
7Jun 4, 2026 23:4463,265319,149,883307,905,0002,097,0002,113,536
8Jun 4, 2026 23:4463,312319,395,663308,144,0002,085,0002,113,536
9Jun 4, 2026 23:4464,187323,589,796312,453,0002,068,0002,113,536