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 listAug 3, 2026 22:10anboto1anboto1Score: 58,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 22:1058,202294,190,390284,081,0001,110,0002,113,536
2Aug 3, 2026 22:1058,212294,277,059284,087,0001,156,0002,113,536
3Aug 3, 2026 22:1058,285294,634,760284,509,0001,089,0002,113,536
4Aug 3, 2026 22:1058,309294,782,865284,593,0001,123,0002,113,536
5Aug 3, 2026 22:1058,425295,396,854285,277,0001,006,0002,113,536
6Aug 3, 2026 22:1058,797297,161,180287,006,0001,101,0002,113,536
7Aug 3, 2026 22:1059,141298,278,410288,702,0001,090,0002,113,536
8Aug 3, 2026 22:1059,147298,844,488288,731,0001,093,0002,113,536
9Aug 3, 2026 22:1059,403300,059,951289,981,0001,098,0002,113,536