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 22, 2026 20:17wnwnScore: 4,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 20:174,41364,912,78635,613,0001,017,0002,502,656
2Feb 22, 2026 20:174,41561,732,95535,626,0001,017,0002,277,376
3Feb 22, 2026 20:174,43863,277,29335,841,000995,0002,277,376
4Feb 22, 2026 20:174,44256,613,75534,877,0001,992,0002,531,328
5Feb 22, 2026 20:174,44659,841,00834,911,0001,994,0002,490,368
6Feb 22, 2026 20:174,45662,022,23734,988,0001,999,0002,494,464
7Feb 22, 2026 20:174,46760,761,02335,070,0002,004,0002,494,464
8Feb 22, 2026 20:174,52563,783,69136,541,0001,015,0002,490,368
9Feb 22, 2026 20:178,49793,343,11569,515,0001,007,0002,277,376