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 24, 2025 17:36Prajeeths18Prajeeths18Score: 1,988,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2025 17:361,983,85116,502,305,28816,400,994,00064,968,0002,285,568
2Aug 24, 2025 17:361,985,57916,509,604,08816,397,346,00082,961,0002,277,376
3Aug 24, 2025 17:361,987,28616,523,866,86716,439,498,00054,974,0002,277,376
4Aug 24, 2025 17:361,987,68716,532,128,19316,418,845,00078,960,0002,277,376
5Aug 24, 2025 17:361,988,37816,534,253,56216,423,583,00079,954,0002,277,376
6Aug 24, 2025 17:361,989,72116,550,307,47216,451,710,00062,972,0002,285,568
7Aug 24, 2025 17:361,995,17016,601,956,34316,491,951,00067,962,0002,277,376
8Aug 24, 2025 17:362,038,41216,951,790,48916,853,858,00064,964,0002,289,664
9Aug 24, 2025 17:362,059,06417,122,657,71317,017,267,00072,966,0002,277,376