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 10:00wnwnScore: 3,389Success
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 10:003,34436,677,29127,760,000020,480
2Sep 29, 2026 10:003,35636,591,12927,858,000020,480
3Sep 29, 2026 10:003,36436,684,93727,927,000020,480
4Sep 29, 2026 10:003,37036,830,42327,972,000020,480
5Sep 29, 2026 10:003,38937,000,24328,131,000020,480
6Sep 29, 2026 10:003,44437,451,23728,588,000020,480
7Sep 29, 2026 10:003,47337,626,87928,829,000020,480
8Sep 29, 2026 10:003,49437,874,59329,008,000020,480
9Sep 29, 2026 10:003,51338,621,51729,159,000020,480