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 listSep 29, 2026 09:34wnwnScore: 3,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 09:353,26135,877,90227,070,000020,480
2Sep 29, 2026 09:353,27035,985,69527,149,000020,480
3Sep 29, 2026 09:353,28336,147,24027,254,000020,480
4Sep 29, 2026 09:353,28438,559,74727,261,000020,480
5Sep 29, 2026 09:353,28736,112,15527,283,000020,480
6Sep 29, 2026 09:353,29636,235,46527,359,000020,480
7Sep 29, 2026 09:353,33436,344,86327,675,000020,480
8Sep 29, 2026 09:353,43037,560,38228,470,000020,480
9Sep 29, 2026 09:353,46938,174,04528,794,000020,480