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 listMay 1, 2025 21:43FeToR1FeToR1Score: 2,067,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2025 21:432,064,62717,167,815,68317,058,431,00077,969,0002,277,376
2May 1, 2025 21:432,065,35717,174,170,22217,069,496,00072,963,0002,277,376
3May 1, 2025 21:432,065,95117,185,046,12517,093,418,00053,979,0002,289,664
4May 1, 2025 21:432,065,97917,178,861,91017,074,662,00072,964,0002,277,376
5May 1, 2025 21:432,067,60117,193,728,47417,106,116,00054,974,0002,285,568
6May 1, 2025 21:432,068,31417,198,249,56017,098,040,00068,967,0002,277,376
7May 1, 2025 21:432,069,65517,208,322,98217,110,162,00067,972,0002,277,376
8May 1, 2025 21:432,124,65617,663,623,79117,570,668,00063,973,0002,277,376
9May 1, 2025 21:432,130,18917,709,423,13717,599,607,00080,961,0002,289,664