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 listApr 26, 2026 15:12olliecrowolliecrowScore: 6,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:126,11263,870,57144,764,0005,968,0002,428,928
2Apr 26, 2026 15:126,14670,954,76148,013,0003,000,0002,314,240
3Apr 26, 2026 15:126,16067,961,39647,119,0004,010,0002,412,544
4Apr 26, 2026 15:126,16965,346,27747,189,0004,016,0002,330,624
5Apr 26, 2026 15:126,19569,693,49949,404,0002,016,0002,322,432
6Apr 26, 2026 15:126,20668,767,65747,475,0004,040,0002,441,216
7Apr 26, 2026 15:126,20667,173,50947,478,0004,040,0002,367,488
8Apr 26, 2026 15:126,20967,225,53648,504,0003,031,0002,363,392
9Apr 26, 2026 15:126,21070,984,31150,536,0001,010,0002,543,616