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 listOct 24, 2025 10:52Priyanshu GuptaPriyanshu GuptaScore: 73,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 10:5273,311633,587,705543,537,00064,944,0002,277,376
2Oct 24, 2025 10:5273,313634,107,045549,549,00058,951,0002,269,184
3Oct 24, 2025 10:5273,317640,780,369550,578,00057,955,0002,265,088
4Oct 24, 2025 10:5273,344631,761,343549,779,00058,976,0002,285,568
5Oct 24, 2025 10:5273,344636,986,847550,776,00057,976,0002,285,568
6Oct 24, 2025 10:5273,375635,518,405549,014,00060,001,0002,285,568
7Oct 24, 2025 10:5273,391639,659,894554,134,00055,013,0002,285,568
8Oct 24, 2025 10:5273,414636,651,597554,303,00055,030,0002,273,280
9Oct 24, 2025 10:5273,508637,755,741544,102,00066,012,0002,285,568