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 listJul 27, 2026 11:15Kevin HeaveyKevin HeaveyScore: 88,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 11:1688,124441,664,342420,666,00011,146,0002,113,536
2Jul 27, 2026 11:1688,130441,805,908420,333,00011,505,00020,480
3Jul 27, 2026 11:1688,137441,781,858420,403,00011,472,00020,480
4Jul 27, 2026 11:1688,169442,057,308420,799,00011,231,0002,113,536
5Jul 27, 2026 11:1688,182441,931,498420,449,00011,647,00020,480
6Jul 27, 2026 11:1688,253443,103,500420,483,00011,957,00020,480
7Jul 27, 2026 11:1688,278442,550,498420,978,00011,585,0002,113,536
8Jul 27, 2026 11:1688,283442,486,749420,484,00012,105,00020,480
9Jul 27, 2026 11:1690,176451,740,467430,279,00011,587,00020,480