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:20Jatin GargJatin GargScore: 66,103Success
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:2066,091574,422,675546,554,0001,998,0002,273,280
2Dec 8, 2025 12:2066,103571,133,996546,656,0001,998,0002,273,280
3Dec 8, 2025 12:2066,320575,097,917548,456,0001,998,0002,273,280