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 21:15Priyansh RathiPriyansh RathiScore: 65,367Success
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 21:1565,314568,716,115540,105,0002,000,0002,371,584
2Mar 2, 2026 21:1565,367572,373,841539,547,0002,997,0002,543,616
3Mar 2, 2026 21:1565,423567,240,265539,009,0004,000,0002,539,520