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 22, 2026 19:21wnwnScore: 4,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 19:214,91865,829,80538,828,0001,991,0002,277,376
2Feb 22, 2026 19:294,92174,623,14639,846,000996,0002,502,656
3Feb 22, 2026 19:294,92962,835,58438,919,0001,995,0002,535,424
4Feb 22, 2026 19:214,93064,615,78338,924,0001,996,0002,494,464
5Feb 22, 2026 19:234,93562,428,69838,962,0001,998,0002,494,464
6Feb 22, 2026 19:234,93762,788,15538,975,0001,998,0002,277,376
7Feb 22, 2026 19:234,93960,659,35138,996,0001,999,0002,494,464
8Feb 22, 2026 19:294,94762,050,63139,059,0002,003,0002,277,376
9Feb 22, 2026 19:214,95666,358,00239,131,0002,006,0002,494,464