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 listFeb 12, 2024 17:49Bubble BoiBubble BoiScore: 69,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2024 17:0469,546641,928,365577,235,16202,269,184
2Feb 12, 2024 17:4969,551634,595,137577,276,67902,273,280
3Feb 12, 2024 17:0469,552636,202,772577,278,84002,273,280
4Feb 12, 2024 17:4969,558649,534,085577,334,67402,265,088
5Feb 12, 2024 17:4969,577641,623,682577,485,14502,273,280
6Feb 12, 2024 17:0469,581636,967,377577,526,33502,277,376