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 listJan 10, 2026 11:04Alexander FrolovAlexander FrolovScore: 47,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 11:0446,662409,049,979386,294,0001,000,0002,478,080
2Jan 10, 2026 11:0446,688414,281,775385,515,0001,997,0002,531,328
3Jan 10, 2026 11:0446,696413,191,549386,581,000998,0002,531,328
4Jan 10, 2026 11:0446,698412,109,981385,595,0001,997,0002,482,176
5Jan 10, 2026 11:0447,043416,741,540389,452,0001,001,0002,490,368
6Jan 10, 2026 11:0447,050415,879,770388,520,0001,997,0002,277,376
7Jan 10, 2026 11:0447,053421,798,017388,540,0001,997,0002,486,272
8Jan 10, 2026 11:0447,061414,031,768389,609,000998,0002,277,376
9Jan 10, 2026 11:0447,063412,736,200388,625,0001,998,0002,498,560