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 18:11anboto1anboto1Score: 147,481Success
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 18:12147,036730,438,333719,406,0001,073,0002,113,536
2Jul 31, 2026 18:12147,125730,898,383719,826,0001,090,0002,113,536
3Jul 31, 2026 18:12147,259731,560,660720,482,0001,091,0002,113,536
4Jul 31, 2026 18:12147,390732,247,600720,995,0001,217,0002,113,536
5Jul 31, 2026 18:12147,481732,644,904721,594,0001,067,0002,113,536
6Jul 31, 2026 18:12147,537732,841,013721,854,0001,078,0002,113,536
7Jul 31, 2026 18:12147,551732,906,474721,929,0001,075,0002,113,536
8Jul 31, 2026 18:12147,562733,098,082721,993,0001,065,0002,113,536
9Jul 31, 2026 18:12147,724733,758,271722,776,0001,072,0002,113,536