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 listSep 17, 2026 00:41Andrew EpsteinAndrew EpsteinScore: 5,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:415,10452,866,59740,222,0002,145,0002,121,728stderr
2Sep 17, 2026 00:415,14152,952,72540,484,0002,192,0002,121,728stderr
3Sep 17, 2026 00:415,21953,715,29641,161,0002,158,0002,121,728stderr
4Sep 17, 2026 00:415,22853,999,44041,126,0002,270,0002,121,728stderr
5Sep 17, 2026 00:415,24853,976,98541,376,0002,184,0002,121,728stderr
6Sep 17, 2026 00:415,27955,903,26841,767,0002,050,0002,121,728stderr
7Sep 17, 2026 00:415,29255,057,12541,663,0002,265,0002,121,728stderr
8Sep 17, 2026 00:415,30255,070,09441,827,0002,183,0002,121,728stderr
9Sep 17, 2026 00:415,30554,456,70241,975,0002,061,0002,121,728stderr