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 listOct 16, 2024 23:40Serge SmirnovSerge SmirnovScore: 31,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 23:3931,295289,204,316257,748,0001,998,0002,285,568
2Oct 16, 2024 23:4031,367282,810,809259,349,0001,001,0002,277,376
3Oct 16, 2024 23:3931,403292,583,048258,645,0001,997,0002,269,184
4Oct 16, 2024 23:4031,417288,287,743258,764,0001,998,0002,285,568
5Oct 16, 2024 23:3933,132299,654,458272,996,0001,999,0002,285,568
6Oct 16, 2024 23:4033,177299,853,491274,365,0001,001,0002,285,568