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 16, 2026 20:37Yuriy LyfenkoYuriy LyfenkoScore: 10,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 20:3710,185109,137,37983,532,0001,006,0002,277,376
2Mar 16, 2026 20:3710,219114,980,07083,822,000997,0002,519,040
3Mar 16, 2026 20:3710,223117,083,82283,845,0001,010,0002,273,280