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 listSep 24, 2024 14:52Tim ZhamoidinTim ZhamoidinScore: 1,828,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2024 14:521,825,45515,182,626,57915,091,302,00059,977,0002,281,472
2Sep 24, 2024 14:521,826,60115,195,675,08215,084,827,00075,963,0002,289,664
3Sep 24, 2024 14:521,826,96415,199,240,45115,107,827,00055,973,0002,281,472
4Sep 24, 2024 14:521,827,86915,203,241,83115,096,347,00074,966,0002,375,680
5Sep 24, 2024 14:521,828,18415,205,306,23915,102,960,00070,971,0002,519,040
6Sep 24, 2024 14:521,828,92315,208,247,86615,106,093,00073,966,0002,523,136
7Sep 24, 2024 14:521,829,18315,218,112,83515,123,246,00058,977,0002,293,760
8Sep 24, 2024 14:521,829,69915,215,062,12515,098,534,00087,968,0002,289,664
9Sep 24, 2024 14:521,836,45215,272,030,88915,160,590,00081,965,0002,281,472