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 19, 2026 13:56lolrdor1gamerlolrdor1gamerScore: 41,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 13:5640,497357,520,456336,124,00002,383,872
2Feb 19, 2026 13:5640,501361,767,097336,158,00002,523,136
3Feb 19, 2026 13:5640,553363,987,231334,591,0001,997,0002,502,656
4Feb 19, 2026 13:5640,556362,319,755335,620,000998,0002,379,776
5Feb 19, 2026 13:5641,066363,649,973339,852,000999,0002,375,680
6Feb 19, 2026 13:5641,139370,693,419341,452,00002,527,232
7Feb 19, 2026 13:5641,161370,925,047340,640,000998,0002,523,136
8Feb 19, 2026 13:5641,166377,513,523339,680,0001,998,0002,392,064
9Feb 19, 2026 13:5641,199371,044,656340,949,000999,0002,523,136