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 listMar 20, 2025 11:35Adam PelcAdam PelcScore: 1,826,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2025 11:351,823,38615,171,926,15615,069,130,00064,970,0002,277,376
2Mar 20, 2025 11:351,824,27615,172,050,14415,076,517,00064,972,0002,277,376
3Mar 20, 2025 11:351,825,57215,188,597,01615,084,282,00067,969,0002,277,376
4Mar 20, 2025 11:351,826,31515,192,547,08315,102,436,00055,975,0002,277,376
5Mar 20, 2025 11:351,826,35815,189,702,42015,079,816,00078,957,0002,265,088
6Mar 20, 2025 11:351,827,87815,199,378,41315,091,423,00079,965,0002,277,376
7Mar 20, 2025 11:351,829,45115,221,477,53715,116,475,00067,970,0002,277,376
8Mar 20, 2025 11:351,830,04815,222,121,56415,103,440,00085,962,0002,523,136
9Mar 20, 2025 11:351,864,32815,509,856,51915,399,956,00073,966,0002,277,376