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 28, 2025 10:02dhairyadhairyaScore: 1,825,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2025 10:021,821,11215,144,962,37215,057,258,00057,974,0002,277,376
2Feb 28, 2025 10:021,823,64815,167,978,54615,079,302,00056,974,0002,289,664
3Feb 28, 2025 10:021,824,32715,172,256,02315,054,959,00086,959,0002,277,376
4Feb 28, 2025 10:021,825,14615,176,991,11115,080,744,00067,971,0002,277,376
5Feb 28, 2025 10:021,825,41415,179,887,76015,076,974,00073,965,0002,289,664
6Feb 28, 2025 10:021,825,88315,186,215,73415,085,859,00068,971,0002,277,376
7Feb 28, 2025 10:021,829,42515,214,285,38515,111,259,00072,967,0002,289,664
8Feb 28, 2025 10:021,831,17915,231,548,69815,127,816,00070,966,0002,277,376
9Feb 28, 2025 10:021,832,82515,245,888,51015,156,472,00055,975,0002,523,136