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 25, 2021 18:50Yuriy LyfenkoYuriy LyfenkoScore: 17,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2021 18:5017,497167,173,809145,222,00002,387,968
2May 25, 2021 18:5017,499170,894,008145,239,00002,392,064
3May 25, 2021 18:5017,499172,463,310144,237,0001,001,0002,387,968
4May 25, 2021 18:5017,501166,495,453145,259,00002,260,992
5May 25, 2021 18:5017,503172,244,407145,275,00002,260,992
6May 25, 2021 18:5017,504166,028,339143,281,0002,003,0002,260,992
7May 25, 2021 18:5017,505166,228,128143,288,0002,004,0002,387,968
8May 25, 2021 18:5017,510172,589,735145,330,00002,392,064
9May 25, 2021 18:5017,516172,053,595145,382,00002,260,992
10May 25, 2021 18:5017,564187,765,345145,780,57302,277,376
11May 25, 2021 18:5017,572188,166,988145,847,16302,273,280
12May 25, 2021 18:5018,364219,752,789152,420,19502,269,184