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 10, 2024 07:26Matt StuchlikMatt StuchlikScore: 24,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2024 07:2621,463240,863,632178,147,03702,293,760
2Apr 10, 2024 07:2622,029255,554,701182,841,14502,293,760
3Apr 10, 2024 07:2622,058257,449,158183,082,40002,297,856
4Apr 10, 2024 07:2624,375228,950,866200,313,0002,003,0002,285,568
5Apr 10, 2024 07:2624,380224,712,701201,352,0001,001,0002,277,376
6Apr 10, 2024 07:2624,381225,081,007200,359,0002,003,0002,285,568
7Apr 10, 2024 07:2624,384228,636,308202,391,00002,285,568
8Apr 10, 2024 07:2624,388225,136,014201,418,0001,002,0002,277,376
9Apr 10, 2024 07:2624,391228,452,506201,441,0001,002,0002,277,376
10Apr 10, 2024 07:2624,392228,437,558201,453,0001,002,0002,273,280
11Apr 10, 2024 07:2624,400232,317,300201,517,0001,002,0002,285,568
12Apr 10, 2024 07:2625,701236,029,275213,318,00002,277,376