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:55Jatin GargJatin GargScore: 61,635Success
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:5561,615538,663,271510,407,0001,000,0002,519,040
2Dec 8, 2025 11:5561,619537,957,118510,439,0001,000,0002,379,776
3Dec 8, 2025 11:5561,630540,247,702510,528,000999,0002,277,376
4Dec 8, 2025 11:5561,633538,257,750509,559,0001,998,0002,265,088
5Dec 8, 2025 11:5561,635543,673,937510,568,000999,0002,527,232
6Dec 8, 2025 11:5561,635542,029,018509,569,0001,998,0002,523,136
7Dec 8, 2025 11:5561,638543,734,156509,597,0001,998,0002,523,136
8Dec 8, 2025 11:5561,639542,145,413510,603,000999,0002,285,568
9Dec 8, 2025 11:5561,643536,315,603509,636,0001,998,0002,285,568