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:40Victor MerckléVictor MerckléScore: 54,542Success
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:4154,521275,209,606264,971,0002,185,0002,113,536
2Jun 18, 2026 11:4154,529274,912,435265,038,0002,156,0002,113,536
3Jun 18, 2026 11:4154,537274,851,124265,063,0002,171,0002,113,536
4Jun 18, 2026 11:4154,538275,287,441265,102,0002,137,0002,113,536
5Jun 18, 2026 11:4154,542274,942,101265,055,0002,202,0002,113,536
6Jun 18, 2026 11:4154,589275,153,292265,349,0002,139,0002,113,536
7Jun 18, 2026 11:4154,605275,188,023265,533,0002,033,0002,113,536
8Jun 18, 2026 11:4154,640275,375,126265,583,0002,154,0002,113,536
9Jun 18, 2026 11:4154,681275,584,949265,782,0002,156,0002,113,536