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 listJun 23, 2025 21:00Valentin KofmanValentin KofmanScore: 7,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 21:007,23980,364,76758,079,0002,002,0002,383,872
2Jun 23, 2025 21:007,23981,360,78958,083,0002,002,0002,269,184
3Jun 23, 2025 21:007,24087,482,21258,090,0002,003,0002,367,488
4Jun 23, 2025 21:007,24187,999,92858,101,0002,003,0002,289,664
5Jun 23, 2025 21:007,24480,877,28258,123,0002,004,0002,277,376
6Jun 23, 2025 21:007,29887,015,23559,566,0001,009,0002,289,664
7Jun 23, 2025 21:007,29988,544,24059,573,0001,009,0002,289,664
8Jun 23, 2025 21:007,30590,143,98259,625,0001,010,0002,289,664
9Jun 23, 2025 21:007,32889,165,99759,826,000997,0002,289,664
10Jun 23, 2025 21:009,865107,085,93579,884,0001,997,0002,269,184
11Jun 23, 2025 21:009,870106,506,01579,926,0001,998,0002,289,664
12Jun 23, 2025 21:009,901108,918,71680,173,0002,004,0002,281,472