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 listMay 24, 2021 06:07evgenikwtevgenikwtScore: 47,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 06:5447,318459,014,581392,736,11302,269,184
2May 24, 2021 06:0447,400456,340,944393,416,81502,273,280
3May 24, 2021 06:0747,411448,176,675393,510,26402,240,512
4May 24, 2021 06:5447,425462,195,095393,624,44702,273,280
5May 24, 2021 06:5447,427452,061,925393,647,49502,273,280
6May 24, 2021 06:0447,465458,473,276393,961,68302,265,088
7May 24, 2021 06:0747,472432,006,741394,014,70502,273,280
8May 24, 2021 06:0747,477455,501,620394,057,25502,256,896
9May 24, 2021 06:0447,493453,422,496394,189,06302,269,184