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:16anboto1anboto1Score: 200,876Success
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:17199,964990,045,690867,455,000112,372,0002,113,536
2Jul 31, 2026 17:17200,742993,764,530871,573,000112,066,0002,113,536
3Jul 31, 2026 17:17200,787994,007,222871,499,000112,359,0002,113,536
4Jul 31, 2026 17:17200,806994,249,722872,223,000111,729,0002,113,536
5Jul 31, 2026 17:17200,876995,245,976872,027,000112,268,0002,113,536
6Jul 31, 2026 17:17201,4531,004,366,303875,191,000111,930,0002,113,536
7Jul 31, 2026 17:17202,1151,002,269,085877,143,000113,224,0002,113,536
8Jul 31, 2026 17:17202,1721,000,783,610878,640,000112,006,0002,113,536
9Jul 31, 2026 17:17202,4371,002,214,350878,933,000113,011,0002,113,536