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 01:50Victor MerckléVictor MerckléScore: 52,888Success
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 01:5152,690265,580,801256,174,0002,010,0002,113,536
2Jun 18, 2026 01:5152,792267,450,273256,517,0002,165,0002,113,536
3Jun 18, 2026 01:5152,802266,843,130256,596,0002,138,0002,113,536
4Jun 18, 2026 01:5152,858266,502,089256,828,0002,178,0002,113,536
5Jun 18, 2026 01:5152,888266,950,971257,123,0002,030,0002,113,536
6Jun 18, 2026 01:5152,974266,986,798257,360,0002,213,0002,113,536
7Jun 18, 2026 01:5153,737270,819,895261,257,0002,056,0002,113,536
8Jun 18, 2026 01:5154,312273,535,256263,992,0002,140,0002,113,536
9Jun 18, 2026 01:5154,441274,188,722264,619,0002,143,0002,113,536