Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 16, 2026 08:09wnwnScore: 3,350Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:093,28735,192,38226,244,0001,042,0002,113,536
2Jul 16, 2026 08:093,29835,310,72326,278,0001,097,0002,113,536
3Jul 16, 2026 08:093,31035,474,60026,443,0001,031,0002,113,536
4Jul 16, 2026 08:093,33635,630,28926,661,0001,031,0002,113,536
5Jul 16, 2026 08:093,35035,849,56426,805,0001,008,0002,113,536
6Jul 16, 2026 08:093,38035,967,11327,014,0001,040,0002,113,536
7Jul 16, 2026 08:093,43937,254,96127,545,0001,001,0002,113,536
8Jul 16, 2026 08:093,47137,542,51027,806,0001,007,0002,113,536
9Jul 16, 2026 08:093,47336,951,20227,785,0001,043,0002,113,536