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 6, 2026 14:28Danylo MocherniukDanylo MocherniukScore: 7,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 14:287,14783,276,15656,304,0003,016,0002,367,488
2Apr 6, 2026 14:287,17183,019,58457,503,0002,017,0002,379,776
3Apr 6, 2026 14:287,20687,388,93956,820,0002,990,0002,297,856
4Apr 6, 2026 14:287,25788,622,85659,227,0001,003,0002,297,856
5Apr 6, 2026 14:287,25786,720,58757,223,0003,011,0002,293,760
6Apr 6, 2026 14:287,25891,767,84457,228,0003,012,0002,359,296
7Apr 6, 2026 14:287,25981,477,08057,236,0003,012,0002,375,680
8Apr 6, 2026 14:287,38588,093,44759,285,0002,009,0002,367,488
9Apr 6, 2026 14:287,43987,841,39258,760,0002,987,0002,371,584