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 28, 2025 08:09dhairyadhairyaScore: 1,826,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2025 08:091,826,31015,191,886,50415,085,403,00072,968,0002,265,088
2Feb 28, 2025 08:091,826,50315,187,095,13415,078,006,00081,967,0002,277,376
3Feb 28, 2025 08:091,826,52115,192,356,82415,084,158,00075,965,0002,277,376
4Feb 28, 2025 08:091,826,63915,193,979,42615,095,126,00065,974,0002,273,280
5Feb 28, 2025 08:091,826,74015,199,218,69415,096,972,00064,969,0002,277,376
6Feb 28, 2025 08:091,827,39415,205,388,04315,093,407,00073,967,0002,277,376
7Feb 28, 2025 08:091,831,42015,230,886,85615,145,816,00054,973,0002,277,376
8Feb 28, 2025 08:091,961,70616,312,058,85116,218,185,00063,973,0002,277,376
9Feb 28, 2025 08:091,961,87616,318,030,49316,214,602,00068,968,0002,289,664