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 14:07wnwnScore: 5,041Success
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 14:075,03867,557,06940,824,000995,0002,531,328
2Feb 20, 2026 14:075,04068,293,21040,840,000996,0002,502,656
3Feb 20, 2026 14:075,04170,490,08639,847,0001,992,0002,277,376
4Feb 20, 2026 14:075,04165,436,65039,845,0001,992,0002,486,272
5Feb 20, 2026 14:075,04172,363,62640,841,000996,0002,277,376
6Feb 20, 2026 14:075,05165,461,92639,931,0001,996,0002,277,376
7Feb 20, 2026 14:075,05460,747,92139,949,0001,997,0002,498,560
8Feb 20, 2026 14:075,05464,956,18539,954,0001,997,0002,502,656
9Feb 20, 2026 14:075,16272,308,46440,854,0001,992,0002,277,376