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 28, 2022 17:56Bernard TeoBernard TeoScore: 6,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 17:566,283104,731,37052,150,11302,281,472
2Dec 28, 2022 17:566,286110,393,19552,175,97502,285,568
3Dec 28, 2022 17:566,302123,331,37352,307,95502,285,568
4Dec 28, 2022 17:566,44676,033,69152,493,0001,009,0002,273,280
5Dec 28, 2022 17:566,44982,619,07253,530,00002,404,352
6Dec 28, 2022 17:566,45278,073,32653,551,00002,273,280
7Dec 28, 2022 17:566,45777,878,88952,583,0001,011,0002,273,280
8Dec 28, 2022 17:566,46085,046,71953,619,00002,273,280
9Dec 28, 2022 17:566,46178,897,71952,614,0001,011,0002,273,280
10Dec 28, 2022 17:566,46279,362,01653,638,00002,273,280
11Dec 28, 2022 17:566,46278,110,76752,625,0001,012,0002,396,160
12Dec 28, 2022 17:566,46476,619,98752,638,0001,012,0002,273,280
13Dec 28, 2022 17:566,46578,414,64252,645,0001,012,0002,392,064
14Dec 28, 2022 17:566,48482,906,55152,825,000996,0002,387,968
15Dec 28, 2022 17:566,48679,333,72352,836,000996,0002,273,280