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 listFeb 14, 2026 15:39Juraj ZelmanJuraj ZelmanScore: 10,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 15:3910,676117,793,16887,601,0001,006,0002,285,568
2Feb 14, 2026 15:3910,697119,147,38087,785,000997,0002,486,272
3Feb 14, 2026 15:3910,703117,339,73787,834,000998,0002,363,392
4Feb 14, 2026 15:3910,759116,602,62387,295,0002,006,0002,293,760
5Feb 14, 2026 15:3910,777110,649,23288,447,0001,005,0002,293,760
6Feb 14, 2026 15:3910,778119,719,50088,456,0001,005,0002,293,760
7Feb 14, 2026 15:3910,778111,637,89889,460,00002,375,680
8Feb 14, 2026 15:3910,783110,529,70088,492,0001,005,0002,367,488
9Feb 14, 2026 15:3910,787114,702,93989,533,00002,293,760
10Feb 14, 2026 15:3910,787114,582,95388,525,0001,005,0002,367,488
11Feb 14, 2026 15:3910,799115,688,62988,624,0001,007,0002,293,760
12Feb 14, 2026 15:3910,815116,614,16587,770,0001,994,0002,293,760