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:06anboto1anboto1Score: 63,146Success
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:0663,089318,220,423308,044,0001,095,0002,113,536
2Aug 3, 2026 20:0663,102317,669,066308,084,0001,118,0002,113,536
3Aug 3, 2026 20:0663,120317,704,878308,199,0001,091,0002,113,536
4Aug 3, 2026 20:0663,146317,903,333308,244,0001,176,0002,113,536
5Aug 3, 2026 20:0663,146317,935,415308,301,0001,115,0002,113,536
6Aug 3, 2026 20:0663,173318,494,987308,382,0001,170,0002,113,536
7Aug 3, 2026 20:0663,352319,594,184309,293,0001,133,0002,113,536
8Aug 3, 2026 20:0664,597325,477,474315,435,0001,092,0002,113,536
9Aug 3, 2026 20:0667,545339,486,557329,833,0001,141,0002,113,536