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 listMay 11, 2026 11:18Victor MerckléVictor MerckléScore: 102,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 11:19102,354511,024,474499,315,0002,222,0002,113,536
2May 11, 2026 11:19102,361511,740,556499,371,0002,198,0002,113,536
3May 11, 2026 11:19102,445512,152,168499,975,0002,009,0002,113,536
4May 11, 2026 11:19102,465510,857,874499,834,0002,246,0002,113,536
5May 11, 2026 11:19102,466512,804,136499,856,0002,231,0002,113,536
6May 11, 2026 11:19102,810513,899,478501,555,0002,217,0002,113,536
7May 11, 2026 11:19102,838514,745,655501,903,0002,008,0002,113,536
8May 11, 2026 11:19102,848513,971,339501,785,0002,174,0002,113,536
9May 11, 2026 11:19102,857513,225,282501,809,0002,192,0002,113,536