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 22, 2026 05:22wnwnScore: 3,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:223,69149,381,82629,622,0001,021,0002,478,080
2Apr 22, 2026 05:223,69547,364,96429,654,0001,022,0002,490,368
3Apr 22, 2026 05:223,70942,648,31528,806,0001,986,0002,486,272
4Apr 22, 2026 05:223,75848,797,11330,187,0001,006,0002,478,080
5Apr 22, 2026 05:223,76645,448,21130,251,0001,008,0002,494,464
6Apr 22, 2026 05:223,85952,786,87930,032,0002,002,0002,486,272
7Apr 22, 2026 05:223,86045,351,45230,041,0002,002,0002,482,176
8Apr 22, 2026 05:223,89949,288,36231,353,0001,011,0002,330,624
9Apr 22, 2026 05:223,94254,651,41230,741,0001,983,0002,490,368