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:21anboto1anboto1Score: 147,369Success
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:22147,059730,468,379719,509,0001,082,0002,113,536
2Jul 31, 2026 18:22147,133730,994,616719,867,0001,086,0002,113,536
3Jul 31, 2026 18:22147,136731,137,724719,890,0001,079,0002,113,536
4Jul 31, 2026 18:22147,271731,743,761720,542,0001,086,0002,113,536
5Jul 31, 2026 18:22147,369732,825,778720,022,0002,090,0002,113,536
6Jul 31, 2026 18:22147,465734,517,598721,496,0001,087,0002,113,536
7Jul 31, 2026 18:22147,469733,759,861721,496,0001,104,0002,113,536
8Jul 31, 2026 18:22147,531733,186,269721,812,0001,090,0002,113,536
9Jul 31, 2026 18:22147,564733,016,710721,989,0001,075,0002,113,536