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 listFeb 18, 2026 10:22CheckHarryCheckHarryScore: 57,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:2257,181497,969,493470,606,0003,996,0002,478,080
2Feb 18, 2026 10:2257,259503,551,870474,254,000998,0002,523,136
3Feb 18, 2026 10:2257,262508,234,779473,277,0002,001,0002,375,680