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 22, 2026 19:50wnwnScore: 31,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 14:4930,975280,539,372255,095,0002,000,0002,269,184
2Mar 22, 2026 19:5031,001280,367,559256,308,0001,001,0002,473,984
3Mar 21, 2026 14:4931,010283,244,561256,383,0001,001,0002,273,280
4Mar 21, 2026 14:4931,022283,114,467256,485,0001,001,0002,490,368
5Mar 22, 2026 19:5031,050281,896,987255,719,0001,997,0002,486,272
6Mar 22, 2026 19:5031,059285,102,235255,788,0001,998,0002,490,368