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 listDec 21, 2024 09:17mahdi739mahdi739Score: 59,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 09:1759,508518,112,694492,920,000999,0002,367,488
2Dec 21, 2024 09:1759,508522,573,676492,920,000999,0002,371,584
3Dec 21, 2024 09:1759,518515,682,178491,999,0001,999,0002,285,568
4Dec 21, 2024 09:1759,520517,169,359492,015,0002,000,0002,285,568
5Dec 21, 2024 09:1759,522518,209,173493,035,0001,000,0002,371,584
6Dec 21, 2024 09:1759,524515,834,032492,050,0002,000,0002,375,680
7Dec 21, 2024 09:1759,526524,720,768492,067,0002,000,0002,359,296
8Dec 21, 2024 09:1759,536517,083,849492,150,0002,000,0002,285,568
9Dec 21, 2024 09:1759,544528,158,793493,219,0001,000,0002,285,568