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 16, 2025 19:27BenzotoporBenzotoporScore: 53,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2025 19:2753,339465,479,287440,719,0001,998,0002,285,568
2Oct 16, 2025 19:2753,342464,305,503441,738,000999,0002,285,568
3Oct 16, 2025 19:2753,344465,011,469440,761,0001,998,0002,289,664
4Oct 16, 2025 19:2753,385468,889,262441,094,0002,000,0002,265,088
5Oct 16, 2025 19:2753,391464,880,826441,143,0002,000,0002,273,280
6Oct 16, 2025 19:2753,399464,282,463442,211,0001,000,0002,285,568
7Oct 16, 2025 19:2753,409465,356,109442,298,0001,000,0002,260,992
8Oct 16, 2025 19:2753,416469,243,740442,351,0001,000,0002,285,568
9Oct 16, 2025 19:2753,450469,130,437441,640,0001,998,0002,273,280