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 listMar 13, 2026 05:05olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:14Yuriy Lyfenko10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:15016,483,48001,015,000405,504Exit with code 1:
2Mar 13, 2026 05:052,10040,596,53117,429,00002,531,328
3Mar 13, 2026 05:052,10538,659,01617,470,00002,273,280
4Mar 13, 2026 05:052,11142,040,71017,522,00002,273,280