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 listMar 7, 2025 04:25Steve BronderSteve BronderScore: 1,826,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2025 04:251,825,09415,177,841,43715,082,314,00065,970,0002,277,376
2Mar 7, 2025 04:251,826,15915,194,668,27815,076,154,00080,968,0002,289,664
3Mar 7, 2025 04:251,826,41415,195,252,65115,093,267,00065,970,0002,277,376
4Mar 7, 2025 04:251,826,52815,193,206,71615,077,223,00082,962,0002,289,664
5Mar 7, 2025 04:251,826,53515,201,338,12215,104,262,00055,975,0002,289,664
6Mar 7, 2025 04:251,826,77315,195,592,05515,086,249,00075,966,0002,277,376
7Mar 7, 2025 04:251,831,08515,230,141,23515,126,038,00071,966,0002,277,376
8Mar 7, 2025 04:251,911,88215,900,148,34715,800,649,00067,972,0002,265,088
9Mar 7, 2025 04:251,911,97215,902,852,67415,809,395,00059,974,0002,289,664