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:33olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:15Yuriy Lyfenko10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:16018,487,71101,015,000401,408Exit with code 1:
2Mar 13, 2026 05:332,09143,048,63617,352,00002,273,280
3Mar 13, 2026 05:332,11040,562,67917,515,00002,273,280
4Mar 13, 2026 05:332,11645,141,58617,562,00002,506,752