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 listAug 26, 2025 14:03Ashish AhujaAshish AhujaScore: 11,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 14:0310,949119,221,56269,146,00021,731,0002,297,856
2Aug 26, 2025 14:0311,198131,771,44470,960,00021,987,0002,314,240
3Aug 26, 2025 14:0311,215122,042,72975,066,00018,016,0002,367,488
4Aug 26, 2025 14:0311,225122,623,44875,325,00017,840,0002,367,488
5Aug 26, 2025 14:0311,237122,817,58874,418,00018,852,0002,531,328
6Aug 26, 2025 14:0311,739126,945,69876,555,00020,878,0002,326,528