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 2, 2025 17:43ndrenndrenScore: 77,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2025 17:4377,670669,566,758642,661,0001,998,0002,392,064
2Apr 2, 2025 17:4377,800670,863,046644,741,000999,0002,260,992
3Apr 2, 2025 17:4377,820673,813,991644,907,000999,0002,387,968
4Apr 2, 2025 17:4377,868675,524,651645,304,0001,000,0002,523,136
5Apr 2, 2025 17:4377,891674,285,054644,496,0001,998,0002,260,992
6Apr 2, 2025 17:4377,898675,555,822644,552,0001,998,0002,523,136
7Apr 2, 2025 17:4377,898674,196,461645,558,000999,0002,260,992
8Apr 2, 2025 17:4377,909680,550,916644,648,0001,998,0002,523,136
9Apr 2, 2025 17:4377,948673,208,315645,971,000999,0002,260,992