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 26, 2025 09:55dhairyadhairyaScore: 1,827,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2025 09:551,825,81315,183,267,64115,081,280,00072,967,0002,289,664
2Feb 26, 2025 09:551,826,61015,193,070,98615,086,895,00073,970,0002,289,664
3Feb 26, 2025 09:551,826,69115,197,665,50215,085,577,00075,962,0002,277,376
4Feb 26, 2025 09:551,827,57115,198,823,35815,105,869,00062,970,0002,277,376
5Feb 26, 2025 09:551,827,58615,201,622,04315,096,996,00071,966,0002,289,664
6Feb 26, 2025 09:551,829,30715,220,991,23315,107,285,00075,966,0002,277,376
7Feb 26, 2025 09:551,831,47015,231,013,26315,128,235,00072,967,0002,277,376
8Feb 26, 2025 09:551,848,17715,371,992,88515,270,898,00068,972,0002,277,376
9Feb 26, 2025 09:552,048,58817,034,660,72816,931,308,00071,971,0002,277,376