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 listAug 16, 2025 12:02Ashish AhujaAshish AhujaScore: 30,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 12:0230,703277,598,783251,840,0002,998,0002,277,376
2Aug 16, 2025 12:0230,713278,134,251252,923,0001,999,0002,289,664
3Aug 16, 2025 12:0230,721277,838,422251,984,0002,999,0002,285,568
4Aug 16, 2025 12:0230,730280,098,307252,059,0003,000,0002,277,376
5Aug 16, 2025 12:0230,746278,031,459252,186,0003,002,0002,285,568
6Aug 16, 2025 12:0230,747279,413,459253,199,0002,001,0002,408,448
7Aug 16, 2025 12:0230,757276,666,509252,278,0003,003,0002,293,760
8Aug 16, 2025 12:0230,763277,680,057252,329,0003,003,0002,285,568
9Aug 16, 2025 12:0232,553301,366,846267,189,0003,002,0002,285,568