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 listFeb 4, 2025 07:36mebowlermebowlerScore: 77,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2025 07:3676,980659,494,854636,937,0001,999,0002,330,624
2Feb 4, 2025 07:3676,987663,877,604634,997,0003,999,0002,314,240
3Feb 4, 2025 07:3677,004663,480,258639,134,00002,330,624
4Feb 4, 2025 07:3677,005660,256,474637,144,0002,000,0002,330,624
5Feb 4, 2025 07:3677,017670,279,347637,245,0002,000,0002,326,528
6Feb 4, 2025 07:3677,030666,166,531639,347,00002,330,624
7Feb 4, 2025 07:3677,033670,271,038638,375,000999,0002,330,624
8Feb 4, 2025 07:3677,057662,797,392635,572,0003,997,0002,310,144
9Feb 4, 2025 07:3677,078661,848,310638,749,000999,0002,326,528