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 listApr 28, 2026 12:53Dominique GarmierDominique GarmierScore: 8,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 12:548,20388,337,97465,085,0003,003,0002,371,584
2Apr 28, 2026 12:548,21190,343,06765,151,0003,007,0002,318,336
3Apr 28, 2026 12:548,23486,550,98365,328,0003,015,0002,367,488
4Apr 28, 2026 12:548,24184,514,87665,384,0003,017,0002,342,912
5Apr 28, 2026 12:548,24584,914,16666,428,0002,012,0002,371,584
6Apr 28, 2026 12:548,24686,103,71166,433,0002,013,0002,322,432
7Apr 28, 2026 12:548,32290,049,51066,072,0003,003,0002,375,680
8Apr 28, 2026 12:548,33092,380,75866,134,0003,006,0002,367,488
9Apr 28, 2026 12:548,38290,068,54067,557,0002,016,0002,342,912