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 20:36Javid izadiJavid izadiScore: 325,562Success
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 20:36325,1032,723,784,7322,642,391,00055,965,0002,281,472
2Dec 19, 2024 20:36325,1652,723,062,8212,623,900,00074,968,0002,281,472
3Dec 19, 2024 20:36325,2632,729,949,9942,637,712,00061,969,0002,281,472
4Dec 19, 2024 20:36325,4742,726,029,5662,643,470,00057,966,0002,285,568
5Dec 19, 2024 20:36325,5622,730,214,5652,632,216,00069,952,0002,285,568
6Dec 19, 2024 20:36326,4912,735,147,3792,655,900,00053,977,0002,367,488
7Dec 19, 2024 20:36326,7792,740,589,9212,669,297,00042,972,0002,281,472
8Dec 19, 2024 20:36328,0382,746,382,8922,668,745,00053,974,0002,285,568
9Dec 19, 2024 20:36336,4102,823,277,8532,732,246,00059,961,0002,285,568