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 15:43wnwnScore: 5,040Success
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 15:435,03967,044,42739,832,0001,991,0002,277,376
2Feb 20, 2026 15:435,03968,557,54040,827,000995,0002,502,656
3Feb 20, 2026 15:435,03967,046,09539,833,0001,991,0002,277,376
4Feb 20, 2026 15:435,03973,515,91939,835,0001,991,0002,498,560
5Feb 20, 2026 15:435,04072,548,42940,833,000995,0002,490,368
6Feb 20, 2026 15:435,04064,465,71439,841,0001,992,0002,486,272
7Feb 20, 2026 15:435,04064,689,87239,839,0001,991,0002,277,376
8Feb 20, 2026 15:435,04165,131,28939,848,0001,992,0002,277,376
9Feb 20, 2026 15:435,04670,535,84739,889,0001,994,0002,277,376
10Feb 20, 2026 15:435,05270,259,46039,938,0001,996,0002,494,464
11Feb 20, 2026 15:435,05662,244,66239,968,0001,998,0002,494,464
12Feb 20, 2026 15:435,05968,890,68039,990,0001,999,0002,277,376