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 1, 2024 16:38E SequeiraE SequeiraScore: 57,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2024 16:4057,272551,993,295475,354,05102,285,568
2Apr 1, 2024 16:3857,641539,918,288478,420,34502,297,856
3Apr 1, 2024 16:4057,668553,495,144478,640,88902,285,568
4Apr 1, 2024 16:3857,671557,975,917478,672,17902,285,568
5Apr 1, 2024 16:4057,677548,025,015478,716,31802,293,760
6Apr 1, 2024 16:3857,682547,083,276478,758,79402,285,568
7Apr 1, 2024 16:3857,695550,352,735478,870,26602,252,800
8Apr 1, 2024 16:3857,705552,310,053478,948,57802,285,568
9Apr 1, 2024 16:3859,120582,082,896490,693,94902,281,472