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 listSep 27, 2025 06:36SinaSinaScore: 548,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 06:36548,1794,579,377,4394,480,935,00068,952,0002,285,568
2Sep 27, 2025 06:36548,3294,587,511,4604,482,162,00068,971,0002,277,376
3Sep 27, 2025 06:36548,3714,576,633,7274,483,519,00067,962,0002,285,568
4Sep 27, 2025 06:36548,3834,576,573,7604,477,622,00073,960,0002,277,376
5Sep 27, 2025 06:36548,5334,581,352,4504,478,861,00073,964,0002,277,376
6Sep 27, 2025 06:36548,5854,585,745,1404,480,300,00072,956,0002,277,376
7Sep 27, 2025 06:36549,0094,581,232,4484,498,816,00057,958,0002,285,568
8Sep 27, 2025 06:36549,2354,589,441,2894,485,704,00072,946,0002,285,568
9Sep 27, 2025 06:36549,2874,586,058,9534,481,132,00077,950,0002,510,848