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 listAug 15, 2026 19:56Tomislav TunkovicTomislav TunkovicScore: 4,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 19:574,54846,851,89737,749,000020,480
2Aug 15, 2026 19:574,55346,876,53337,792,000020,480
3Aug 15, 2026 19:574,55446,277,09237,804,000020,480
4Aug 15, 2026 19:574,55552,980,32937,807,000020,480
5Aug 15, 2026 19:574,55646,977,86637,819,000020,480
6Aug 15, 2026 19:574,55846,961,07137,838,000020,480
7Aug 15, 2026 19:574,56046,321,75837,856,000020,480
8Aug 15, 2026 19:574,56747,006,42936,895,0001,015,00020,480
9Aug 15, 2026 19:574,57146,394,50636,883,0001,058,00020,480