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 31, 2026 17:46anboto1anboto1Score: 200,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:47199,806989,318,456869,579,000109,475,0002,113,536
2Jul 31, 2026 17:47199,885990,355,496869,664,000109,774,0002,113,536
3Jul 31, 2026 17:47199,938990,645,748869,735,000109,964,0002,113,536
4Jul 31, 2026 17:47200,169991,039,020869,852,000110,979,0002,113,536
5Jul 31, 2026 17:47200,173991,071,614870,050,000110,800,0002,113,536
6Jul 31, 2026 17:47200,238992,157,899870,219,000110,948,0002,113,536
7Jul 31, 2026 17:47200,263992,152,541870,447,000110,842,0002,113,536
8Jul 31, 2026 17:47200,292991,567,097870,423,000111,008,0002,113,536
9Jul 31, 2026 17:47200,435992,262,696870,080,000112,055,0002,113,536