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 16:32Victor MerckléVictor MerckléScore: 76,612Success
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 16:3376,374384,904,309372,104,0002,132,0002,113,536
2May 11, 2026 16:3376,387383,283,421372,061,0002,239,0002,113,536
3May 11, 2026 16:3376,497384,411,790372,652,0002,186,0002,113,536
4May 11, 2026 16:3376,573384,414,837373,199,0002,012,0002,113,536
5May 11, 2026 16:3376,612384,973,532373,341,0002,058,0002,113,536
6May 11, 2026 16:3376,723384,826,729373,734,0002,209,0002,113,536
7May 11, 2026 16:3380,181401,777,781390,855,0002,036,0002,113,536
8May 11, 2026 16:3380,379403,685,374392,857,0001,004,0002,113,536
9May 11, 2026 16:3380,534404,177,127392,572,0002,047,0002,113,536