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 listFeb 12, 2022 21:50Yuriy LyfenkoYuriy LyfenkoScore: 11,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2022 21:5011,341116,747,65992,131,0002,002,0002,289,664
2Feb 12, 2022 21:5011,345120,182,58392,161,0002,003,0002,289,664
3Feb 12, 2022 21:5011,348116,177,62192,184,0002,004,0002,289,664
4Feb 12, 2022 21:5011,354117,520,05593,240,0001,002,0002,289,664
5Feb 12, 2022 21:5011,356123,282,37493,252,0001,002,0002,265,088
6Feb 12, 2022 21:5011,369117,839,28193,362,0001,003,0002,289,664
7Feb 12, 2022 21:5011,369122,095,27693,361,0001,003,0002,273,280
8Feb 12, 2022 21:5011,373120,290,73492,387,0002,008,0002,289,664
9Feb 12, 2022 21:5011,585121,349,22995,156,0001,001,0002,289,664
10Feb 12, 2022 21:5011,950170,081,49399,188,69202,277,376
11Feb 12, 2022 21:5011,953171,055,55599,208,82702,269,184
12Feb 12, 2022 21:5012,201162,356,141101,269,85702,273,280