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 listMar 2, 2026 10:50Priyansh RathiPriyansh RathiScore: 61,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 10:5061,034529,327,513504,587,0001,998,0002,371,584
2Mar 2, 2026 10:5061,046532,270,848504,685,0001,998,0002,355,200
3Mar 2, 2026 10:5061,048533,648,652505,697,000999,0002,396,160