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 27, 2021 14:53Alexander ZhirovAlexander ZhirovScore: 56,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2021 18:0056,334507,748,393467,570,98302,269,184
2May 27, 2021 14:5356,343511,770,545467,644,64602,265,088
3May 27, 2021 18:0056,351515,741,483467,712,21602,269,184
4May 27, 2021 14:5156,352503,909,946467,724,51602,260,992
5May 27, 2021 14:5156,355544,824,762467,744,62002,256,896
6May 27, 2021 14:5156,356507,829,823467,757,19102,252,800
7May 27, 2021 14:5356,359519,957,228467,777,68302,265,088
8May 27, 2021 18:0056,380530,470,576467,950,62002,265,088
9May 27, 2021 14:5356,456532,033,328468,586,58702,265,088