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 10, 2026 09:00wnwnScore: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:013,34235,577,91026,735,0001,005,0002,113,536
2Jul 10, 2026 09:013,35935,720,77026,847,0001,040,0002,113,536
3Jul 10, 2026 09:013,37936,059,56327,020,0001,030,0002,113,536
4Jul 10, 2026 09:013,38935,994,31827,114,0001,020,0002,113,536
5Jul 10, 2026 09:013,46637,362,84627,765,0001,006,0002,113,536
6Jul 10, 2026 09:013,49537,050,34927,970,0001,044,0002,113,536
7Jul 10, 2026 09:013,52537,340,42328,253,0001,012,0002,113,536
8Jul 10, 2026 09:013,54337,268,48728,287,0001,126,0002,113,536
9Jul 10, 2026 09:013,59538,397,81428,825,0001,015,0002,113,536