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 2, 2026 11:36Karthik ReddyKarthik ReddyScore: 3,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 11:373,2523,036,141,49725,937,0001,061,00020,480
2Oct 2, 2026 11:373,2613,036,185,59226,004,0001,067,00020,480
3Oct 2, 2026 11:373,2653,036,120,34826,047,0001,054,00020,480
4Oct 2, 2026 11:373,2663,036,346,95226,040,0001,069,00020,480
5Oct 2, 2026 11:373,2673,036,310,44526,040,0001,080,00020,480
6Oct 2, 2026 11:373,2683,036,299,93426,027,0001,105,00020,480
7Oct 2, 2026 11:373,2703,036,185,54326,076,0001,065,00020,480
8Oct 2, 2026 11:373,2743,036,313,28926,100,0001,079,00020,480
9Oct 2, 2026 11:373,3423,036,718,85926,666,0001,078,00020,480