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:40ndrenndrenScore: 79,022Success
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:4078,892682,793,263653,804,000999,0002,502,656
2Apr 2, 2025 17:4078,981681,746,331654,545,000999,0002,392,064
3Apr 2, 2025 17:4078,982682,076,243653,554,0001,998,0002,506,752
4Apr 2, 2025 17:4078,992684,711,048653,639,0001,998,0002,260,992
5Apr 2, 2025 17:4079,022684,772,871653,887,0001,999,0002,260,992
6Apr 2, 2025 17:4079,036677,406,230654,997,000999,0002,265,088
7Apr 2, 2025 17:4079,049677,904,395656,108,00002,523,136
8Apr 2, 2025 17:4079,060678,525,883656,200,00002,260,992
9Apr 2, 2025 17:4079,139682,829,015655,855,000999,0002,260,992