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 listDec 8, 2025 12:01Jatin GargJatin GargScore: 64,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 12:0164,745562,726,135536,383,0001,000,0002,285,568
2Dec 8, 2025 12:0164,849565,814,968537,244,0001,000,0002,285,568
3Dec 8, 2025 12:0164,887567,398,984537,559,000999,0002,273,280