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 listNov 5, 2025 10:58caandocaandoScore: 5,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 10:585,53067,522,22644,903,000997,0002,514,944
2Nov 5, 2025 10:585,55670,054,19744,108,0002,004,0002,285,568
3Nov 5, 2025 10:585,56967,745,81844,212,0002,009,0002,273,280
4Nov 5, 2025 10:585,57168,799,46345,237,0001,005,0002,285,568
5Nov 5, 2025 10:585,57573,338,78445,270,0001,006,0002,285,568
6Nov 5, 2025 10:585,57968,859,03944,296,0002,013,0002,265,088
7Nov 5, 2025 10:585,58668,041,29145,353,0001,007,0002,363,392
8Nov 5, 2025 10:585,58876,451,93746,378,00002,273,280
9Nov 5, 2025 10:585,59168,442,41145,399,0001,008,0002,367,488
10Nov 5, 2025 10:585,69073,670,13946,226,0001,004,0002,514,944
11Nov 5, 2025 10:585,69270,083,38245,236,0002,010,0002,265,088
12Nov 5, 2025 10:585,70871,416,15746,366,0001,007,0002,285,568