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 22, 2024 18:58Steve HanSteve HanScore: 70,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2024 18:5841,416408,495,607343,753,31702,289,664
2Apr 22, 2024 18:5841,452423,659,695344,055,13902,281,472
3Apr 22, 2024 18:5841,458406,654,106344,099,16602,289,664
4Apr 22, 2024 18:5870,612640,704,535586,079,42602,281,472
5Apr 22, 2024 18:5870,615659,682,907586,102,58402,277,376
6Apr 22, 2024 18:5870,617645,479,846586,117,78502,277,376