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 listSep 21, 2025 07:21sheryllynn24sheryllynn24Score: 9,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 07:219,068104,972,55373,255,0002,007,0002,289,664
2Sep 21, 2025 07:219,07897,230,46274,341,0001,004,0002,379,776
3Sep 21, 2025 07:219,155102,126,02873,991,0001,999,0002,510,848
4Sep 21, 2025 07:219,529106,054,62378,092,0001,001,0002,289,664
5Sep 21, 2025 07:219,595112,669,57278,634,0001,008,0002,363,392
6Sep 21, 2025 07:219,617108,835,97178,823,000997,0002,351,104