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 20:28anboto1anboto1Score: 57,676Success
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 20:2957,562290,496,321280,966,0001,090,0002,113,536
2Aug 3, 2026 20:2957,609290,603,678281,173,0001,115,0002,113,536
3Aug 3, 2026 20:2957,609290,901,401281,153,0001,135,0002,113,536
4Aug 3, 2026 20:2957,651290,912,251281,385,0001,106,0002,113,536
5Aug 3, 2026 20:2957,676291,279,262281,479,0001,137,0002,113,536
6Aug 3, 2026 20:2957,811292,381,872282,165,0001,112,0002,113,536
7Aug 3, 2026 20:2957,826294,514,414282,144,0001,204,0002,113,536
8Aug 3, 2026 20:2957,851292,040,731282,300,0001,171,0002,113,536
9Aug 3, 2026 20:2959,161299,012,574288,774,0001,117,0002,113,536