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 10, 2026 15:37JarnoJarnoScore: 41,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 15:3741,158366,423,880339,613,0001,997,0002,285,568
2Mar 10, 2026 15:3741,163371,447,000340,651,000998,0002,285,568
3Mar 10, 2026 15:3741,163372,257,753339,653,0001,997,0002,285,568
4Mar 10, 2026 15:3741,166367,075,271339,681,0001,998,0002,363,392
5Mar 10, 2026 15:3741,174366,686,603339,744,0001,998,0002,285,568
6Mar 10, 2026 15:3741,175370,347,742339,753,0001,998,0002,359,296
7Mar 10, 2026 15:3741,195364,820,187339,923,0001,999,0002,285,568
8Mar 10, 2026 15:3741,218365,696,617341,108,0001,000,0002,367,488
9Mar 10, 2026 15:3741,663372,486,911344,808,000999,0002,363,392