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 20, 2026 19:27wnwnScore: 5,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 19:305,03863,864,49639,821,0001,991,0002,277,376
2Feb 20, 2026 19:295,04263,849,22039,858,0001,992,0002,494,464
3Feb 20, 2026 19:295,04364,963,88139,864,0001,993,0002,498,560
4Feb 20, 2026 19:305,04466,212,31840,841,0001,021,0002,486,272
5Feb 20, 2026 19:295,05360,582,11339,947,0001,997,0002,482,176
6Feb 20, 2026 19:305,05665,259,57439,969,0001,998,0002,494,464