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 12, 2025 02:00Ashish AhujaAshish AhujaScore: 58,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 02:0058,138509,407,569481,546,000999,0002,277,376
2Aug 12, 2025 02:0058,581511,613,304485,223,0001,000,0002,510,848
3Aug 12, 2025 02:0058,588507,466,740485,277,0001,000,0002,510,848
4Aug 12, 2025 02:0058,645511,741,693484,756,0001,998,0002,277,376
5Aug 12, 2025 02:0058,661513,623,610484,886,0001,999,0002,510,848
6Aug 12, 2025 02:0058,667512,762,067484,938,0001,999,0002,285,568
7Aug 12, 2025 02:0058,697511,546,965486,185,0001,000,0002,277,376
8Aug 12, 2025 02:0058,697508,270,940485,182,0002,000,0002,285,568
9Aug 12, 2025 02:0058,713518,658,468485,319,0001,997,0002,510,848