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 11:52Priyansh RathiPriyansh RathiScore: 49,290Success
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 11:5249,246444,477,569407,741,000999,0002,539,520
2Mar 2, 2026 11:5249,290432,182,765408,110,0001,000,0002,387,968
3Mar 2, 2026 11:5249,411433,994,751406,109,0004,001,0002,355,200