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 17, 2024 08:47Matt StuchlikMatt StuchlikScore: 33,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2024 08:4729,448296,802,967244,419,28902,269,184
2Apr 17, 2024 08:4729,572303,041,082245,444,97702,277,376
3Apr 17, 2024 08:4730,147312,431,828250,218,05402,269,184
4Apr 17, 2024 08:4733,463304,552,524275,749,0001,998,0002,531,328
5Apr 17, 2024 08:4733,516309,994,353276,184,0002,001,0002,273,280
6Apr 17, 2024 08:4733,632301,059,381277,147,0002,001,0002,285,568
7Apr 17, 2024 08:4733,689305,812,446277,623,0001,997,0002,265,088
8Apr 17, 2024 08:4733,737306,153,819278,014,0002,000,0002,265,088
9Apr 17, 2024 08:4733,788307,985,724279,436,0001,001,0002,285,568
10Apr 17, 2024 08:4733,799308,393,756279,530,0001,001,0002,273,280
11Apr 17, 2024 08:4733,821312,574,128278,714,0001,997,0002,285,568
12Apr 17, 2024 08:4733,876302,945,579279,167,0002,001,0002,285,568