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 listDec 19, 2024 21:24Javid izadiJavid izadiScore: 151,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 21:24150,8801,273,208,7081,027,429,000224,875,0002,281,472
2Dec 19, 2024 21:24150,9031,276,205,2711,028,582,000223,909,0002,289,664
3Dec 19, 2024 21:24151,0081,276,818,5461,028,482,000224,886,0002,289,664
4Dec 19, 2024 21:24151,1411,286,731,6761,028,568,000225,905,0002,494,464
5Dec 19, 2024 21:24151,2171,284,342,6091,028,266,000226,838,0002,342,912
6Dec 19, 2024 21:24151,3931,281,506,9701,028,644,000227,921,0002,281,472
7Dec 19, 2024 21:24151,4271,284,182,6441,029,051,000227,789,0002,285,568
8Dec 19, 2024 21:24151,4481,285,530,7551,028,195,000228,820,0002,375,680
9Dec 19, 2024 21:24151,5181,286,869,7321,028,674,000228,927,0002,281,472