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 18, 2025 12:51Ashish AhujaAshish AhujaScore: 11,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 12:5110,936118,558,90384,784,0005,984,0002,383,872
2Aug 18, 2025 12:5110,988118,375,44585,187,0006,013,0002,273,280
3Aug 18, 2025 12:5111,033113,547,62983,613,0007,963,0002,285,568
4Aug 18, 2025 12:5111,119117,629,03884,260,0008,024,0002,535,424
5Aug 18, 2025 12:5111,157120,451,64086,630,0005,974,0002,322,432
6Aug 18, 2025 12:5111,526121,819,33591,638,0004,028,0002,449,408