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 11:44Jatin GargJatin GargScore: 72,725Success
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 11:4472,692631,793,064602,345,0001,000,0002,277,376
2Dec 8, 2025 11:4472,712634,700,070601,512,0001,998,0002,523,136
3Dec 8, 2025 11:4472,718635,835,366602,563,000999,0002,519,040
4Dec 8, 2025 11:4472,718629,439,633602,562,000999,0002,269,184
5Dec 8, 2025 11:4472,725630,030,537602,616,000999,0002,383,872
6Dec 8, 2025 11:4472,726628,826,121601,626,0001,998,0002,285,568
7Dec 8, 2025 11:4472,772632,921,629602,009,0002,000,0002,289,664
8Dec 8, 2025 11:4472,783632,530,276602,097,0002,000,0002,285,568
9Dec 8, 2025 11:4472,819631,584,230602,398,0001,998,0002,289,664