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 31, 2026 11:33Anirudha SarafAnirudha SarafScore: 391,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 11:34391,5163,260,792,2043,180,525,00069,061,00020,480
2Oct 31, 2026 11:34391,5393,271,894,2303,180,708,00069,066,00020,480
3Oct 31, 2026 11:34391,6613,273,911,9723,180,667,00070,123,0002,113,536
4Oct 31, 2026 11:34391,6963,262,110,7323,182,023,00069,055,00020,480
5Oct 31, 2026 11:34391,7573,262,589,5853,181,499,00070,086,0002,113,536
6Oct 31, 2026 11:34392,0483,265,956,4583,181,815,00072,191,0002,113,536
7Oct 31, 2026 11:34392,4073,268,164,2843,187,911,00069,074,00020,480
8Oct 31, 2026 11:34392,4863,268,655,1073,188,573,00069,068,0002,113,536
9Oct 31, 2026 11:34392,5993,269,537,3403,188,483,00070,092,0002,113,536