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 listApr 26, 2024 21:20Joad NacerJoad NacerScore: 28,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2024 21:2028,446259,842,105234,104,0002,000,0002,285,568
2Apr 26, 2024 21:2028,454262,236,525235,170,0001,000,0002,269,184
3Apr 26, 2024 21:2028,456261,933,974235,188,0001,000,0002,285,568
4Apr 26, 2024 21:2028,476263,596,950234,347,0002,002,0002,285,568
5Apr 26, 2024 21:2028,477259,373,145235,357,0001,001,0002,269,184
6Apr 26, 2024 21:2028,485265,480,105235,422,0001,001,0002,519,040
7Apr 26, 2024 21:2028,487259,181,779236,438,00002,260,992
8Apr 26, 2024 21:2028,519260,194,502234,713,0001,997,0002,285,568
9Apr 26, 2024 21:2028,893268,107,210237,818,0001,998,0002,285,568
10Apr 26, 2024 21:2030,070311,911,582249,581,90902,289,664
11Apr 26, 2024 21:2030,101315,780,774249,840,60602,285,568
12Apr 26, 2024 21:2030,129317,701,479250,073,55402,285,568