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 listDec 9, 2025 20:29pseppsepScore: 50,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 20:2950,921451,171,850421,643,000999,0002,523,136
2Dec 9, 2025 20:2950,923448,454,189419,667,0002,997,0002,273,280
3Dec 9, 2025 20:2950,927455,691,249420,690,0002,003,0002,273,280
4Dec 9, 2025 20:2950,930447,523,388420,718,0001,998,0002,265,088
5Dec 9, 2025 20:2950,933451,488,070419,749,0002,998,0002,273,280
6Dec 9, 2025 20:2950,936449,276,697419,768,0002,998,0002,519,040
7Dec 9, 2025 20:2950,940447,967,590420,799,0001,999,0002,273,280
8Dec 9, 2025 20:2950,948447,992,528418,868,0003,998,0002,273,280
9Dec 9, 2025 20:2950,954451,183,544420,923,0001,999,0002,273,280