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 6, 2026 19:10Victor MerckléVictor MerckléScore: 57,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 19:1157,794292,351,126280,950,0002,243,0002,113,536
2Jun 6, 2026 19:1157,811292,385,688281,267,0002,011,0002,113,536
3Jun 6, 2026 19:1157,815292,460,078281,039,0002,258,0002,113,536
4Jun 6, 2026 19:1157,828301,921,747281,239,0002,121,0002,113,536
5Jun 6, 2026 19:1157,871292,640,938281,287,0002,282,0002,113,536
6Jun 6, 2026 19:1157,896292,867,501281,682,0002,010,0002,113,536
7Jun 6, 2026 19:1158,021293,455,300282,046,0002,257,0002,113,536
8Jun 6, 2026 19:1158,471295,626,421284,418,0002,093,0002,113,536
9Jun 6, 2026 19:1158,532295,955,461284,686,0002,122,0002,113,536