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 listJun 6, 2024 16:19eldon-chungeldon-chungScore: 36,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2024 16:1936,153362,521,422300,072,71702,285,568
2Jun 6, 2024 16:1936,172360,873,722300,226,46102,285,568
3Jun 6, 2024 16:1936,214364,884,009300,573,98102,174,976
4Jun 6, 2024 16:1936,550368,715,741303,365,51702,297,856
5Jun 6, 2024 16:1936,557362,107,409303,422,11502,297,856
6Jun 6, 2024 16:1936,572374,614,628303,545,23402,297,856
7Jun 6, 2024 16:1936,578371,317,691303,595,04802,297,856
8Jun 6, 2024 16:1936,599363,612,311303,772,72002,289,664
9Jun 6, 2024 16:1938,236396,853,055317,361,82302,256,896