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 listSep 3, 2026 12:34Victor MerckléVictor MerckléScore: 25,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:3625,731134,576,852124,985,0001,097,0002,117,632stderr
2Sep 3, 2026 12:3625,732134,512,258124,990,0001,098,0002,117,632stderr
3Sep 3, 2026 12:3625,735134,530,779125,001,0001,103,0002,117,632stderr
4Sep 3, 2026 12:3625,741134,587,019125,010,0001,123,0002,117,632stderr
5Sep 3, 2026 12:3625,743134,609,890125,054,0001,090,0002,117,632stderr
6Sep 3, 2026 12:3625,746134,588,340125,067,0001,093,0002,117,632stderr
7Sep 3, 2026 12:3625,748135,853,615125,060,0001,109,0002,117,632stderr
8Sep 3, 2026 12:3625,756135,192,449125,107,0001,100,0002,117,632stderr
9Sep 3, 2026 12:3625,759134,665,921125,096,0001,127,0002,117,632stderr