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 10:58Anirudha SarafAnirudha SarafScore: 67,616Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 13:07Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 10:5967,589571,871,970505,753,00055,241,00020,480
2Oct 31, 2026 10:5967,593572,069,669505,751,00055,274,0002,113,536
3Oct 31, 2026 10:5967,599572,926,583505,559,00055,514,0002,113,536
4Oct 31, 2026 10:5967,606572,056,311505,874,00055,260,0002,113,536
5Oct 31, 2026 10:5967,616572,913,662505,940,00055,281,0002,113,536
6Oct 31, 2026 10:5967,638572,331,955506,110,00055,291,00020,480
7Oct 31, 2026 10:5967,655572,610,358505,302,00056,239,0002,113,536
8Oct 31, 2026 10:5967,661572,810,984505,327,00056,267,0002,113,536
9Oct 31, 2026 10:5967,727573,067,708505,870,00056,267,0002,113,536