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 22, 2025 13:55Uladzislau NestsiarukUladzislau NestsiarukScore: 95,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 13:5595,734818,666,050731,626,00062,967,0002,289,664
2Jan 22, 2025 13:5595,734818,685,237732,623,00061,968,0002,273,280
3Jan 22, 2025 13:5595,741821,064,743736,678,00057,974,0002,277,376
4Jan 22, 2025 13:5595,748824,577,971730,733,00063,976,0002,289,664
5Jan 22, 2025 13:5595,777824,416,490733,950,00060,995,0002,269,184
6Jan 22, 2025 13:5595,811821,951,797738,288,00056,945,0002,277,376
7Jan 22, 2025 13:5595,823822,493,198736,381,00058,950,0002,289,664
8Jan 22, 2025 13:5595,955824,125,707733,474,00062,954,0002,379,776
9Jan 22, 2025 13:5596,080825,292,482732,506,00064,956,0002,289,664