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 15:58Josu San MartinJosu San MartinScore: 56,909Success
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 15:5856,825288,705,977276,252,0002,192,0002,113,536
2Jul 31, 2026 15:5856,873288,851,457276,478,0002,202,0002,113,536
3Jul 31, 2026 15:5856,896288,969,989276,609,0002,184,0002,113,536
4Jul 31, 2026 15:5856,901288,899,268276,809,0002,008,0002,113,536
5Jul 31, 2026 15:5856,909288,861,975276,805,0002,053,0002,113,536
6Jul 31, 2026 15:5856,911288,945,512276,838,0002,030,0002,113,536
7Jul 31, 2026 15:5856,916289,048,363276,810,0002,082,0002,113,536
8Jul 31, 2026 15:5857,023289,583,414277,359,0002,054,0002,113,536
9Jul 31, 2026 15:5857,182290,280,461278,172,0002,022,0002,113,536