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 listApr 3, 2025 07:44Kavya ChopraKavya ChopraScore: 1,827,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2025 07:441,826,24915,187,924,05115,098,890,00058,976,0002,277,376
2Apr 3, 2025 07:441,826,34015,188,279,63815,088,660,00069,965,0002,277,376
3Apr 3, 2025 07:441,826,43915,191,781,47915,076,477,00082,964,0002,289,664
4Apr 3, 2025 07:441,826,52715,198,030,41115,093,206,00066,969,0002,277,376
5Apr 3, 2025 07:441,827,35015,200,006,22515,113,030,00053,975,0002,277,376
6Apr 3, 2025 07:441,827,83115,199,539,58915,105,027,00065,969,0002,289,664
7Apr 3, 2025 07:441,828,57715,208,947,55815,099,220,00077,970,0002,289,664
8Apr 3, 2025 07:441,828,89215,215,501,84815,116,835,00062,970,0002,277,376
9Apr 3, 2025 07:441,830,72815,223,470,80215,121,075,00073,971,0002,277,376