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 19, 2025 23:55Advait IyerAdvait IyerScore: 41,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 23:5541,585375,962,058344,157,0001,000,0002,420,736
2Oct 19, 2025 23:5541,595376,127,048343,240,0002,001,0002,473,984
3Oct 19, 2025 23:5541,597374,829,080344,256,0001,000,0002,469,888
4Oct 19, 2025 23:5541,608380,207,446341,351,0003,992,0002,420,736
5Oct 19, 2025 23:5541,608377,804,054344,349,0001,001,0002,494,464
6Oct 19, 2025 23:5541,611378,687,534343,379,0001,996,0002,428,928
7Oct 19, 2025 23:5541,637377,508,973342,592,0002,996,0002,473,984
8Oct 19, 2025 23:5541,645377,080,948341,660,0003,996,0002,469,888
9Oct 19, 2025 23:5541,668376,250,930344,846,000999,0002,482,176