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 listOct 8, 2026 07:09Karthik ReddyKarthik ReddyScore: 3,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2026 07:103,2373,036,026,37126,868,000020,480
2Oct 8, 2026 07:103,2383,035,896,80726,877,000020,480
3Oct 8, 2026 07:103,2433,037,383,23226,922,000020,480
4Oct 8, 2026 07:103,2443,036,004,19926,931,000020,480
5Oct 8, 2026 07:103,2493,036,051,98126,969,000020,480
6Oct 8, 2026 07:103,2513,036,112,78726,985,000020,480
7Oct 8, 2026 07:103,2623,036,261,05327,078,000020,480
8Oct 8, 2026 07:103,2703,036,207,98426,082,0001,060,00020,480
9Oct 8, 2026 07:103,2823,037,552,25926,217,0001,026,00020,480