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:56anboto1anboto1Score: 174,829Success
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:56173,936863,045,383851,210,0001,080,0002,113,536
2Jul 31, 2026 18:56173,946862,404,094851,260,0001,077,0002,113,536
3Jul 31, 2026 18:56174,089863,084,222851,965,0001,073,0002,113,536
4Jul 31, 2026 18:56174,568865,302,975854,304,0001,084,0002,113,536
5Jul 31, 2026 18:56174,829866,676,321855,600,0001,065,0002,113,536
6Jul 31, 2026 18:56174,866867,110,471855,773,0001,075,0002,113,536
7Jul 31, 2026 18:56174,933867,117,605856,099,0001,074,0002,113,536
8Jul 31, 2026 18:56175,338869,152,524858,083,0001,075,0002,113,536
9Jul 31, 2026 18:56175,641870,831,626859,552,0001,092,0002,113,536