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 listFeb 9, 2025 20:33alxmrcktralxmrcktrScore: 220,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2025 20:33219,6371,851,775,8201,757,027,00065,963,0002,281,472
2Feb 9, 2025 20:33219,7481,851,086,2021,769,941,00053,967,0002,289,664
3Feb 9, 2025 20:33219,7591,849,358,6821,749,040,00074,958,0002,281,472
4Feb 9, 2025 20:33219,8531,851,901,9581,765,818,00058,960,0002,281,472
5Feb 9, 2025 20:33220,2121,854,927,8621,775,796,00051,964,0002,363,392
6Feb 9, 2025 20:33220,3541,857,220,8481,777,971,00050,970,0002,285,568
7Feb 9, 2025 20:33220,4441,860,306,9011,757,700,00071,987,0002,289,664
8Feb 9, 2025 20:33220,6941,860,969,4131,777,798,00053,963,0002,289,664
9Feb 9, 2025 20:33221,9361,869,649,9241,774,100,00067,965,0002,285,568