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 20, 2026 01:37Victor MerckléVictor MerckléScore: 54,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 01:3854,098272,753,747262,959,0002,126,0002,113,536
2Jun 20, 2026 01:3854,134272,859,858263,142,0002,116,0002,113,536
3Jun 20, 2026 01:3854,154272,953,029263,238,0002,121,0002,113,536
4Jun 20, 2026 01:3854,154273,066,239263,314,0002,042,0002,113,536
5Jun 20, 2026 01:3854,161273,039,647263,224,0002,166,0002,113,536
6Jun 20, 2026 01:3854,214273,320,208263,626,0002,025,0002,113,536
7Jun 20, 2026 01:3854,596275,156,581265,444,0002,079,0002,113,536
8Jun 20, 2026 01:3854,678275,557,853265,815,0002,110,0002,113,536
9Jun 20, 2026 01:3855,444279,367,980269,614,0002,063,0002,113,536