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 listJan 29, 2025 02:34Sergey SerebryakovSergey SerebryakovScore: 1,943,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 02:341,943,00816,158,044,04016,062,997,00063,972,0002,285,568
2Jan 29, 2025 02:341,943,34916,158,299,95516,048,825,00080,968,0002,277,376
3Jan 29, 2025 02:341,943,42516,163,750,12716,060,453,00069,971,0002,277,376
4Jan 29, 2025 02:341,943,42716,161,386,64916,054,477,00075,964,0002,277,376
5Jan 29, 2025 02:341,943,45216,163,780,89116,058,681,00071,971,0002,277,376
6Jan 29, 2025 02:341,943,45616,158,428,91416,065,710,00064,974,0002,277,376
7Jan 29, 2025 02:341,943,98216,164,397,88316,065,082,00069,969,0002,273,280
8Jan 29, 2025 02:341,944,00116,164,115,79816,052,241,00082,965,0002,277,376
9Jan 29, 2025 02:341,945,01716,180,494,16116,073,669,00069,968,0002,289,664