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 16:17Priyansh RathiPriyansh RathiScore: 55,788Success
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 16:1755,763491,659,089461,837,000999,0002,363,392
2Mar 2, 2026 16:1755,788492,800,748459,044,0004,000,0002,379,776
3Mar 2, 2026 16:1755,816489,821,698462,269,0001,000,0002,527,232