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 26, 2025 10:33Tejas G.Tejas G.Score: 74,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2025 10:3374,270649,568,945615,443,000999,0002,519,040
2Oct 26, 2025 10:3374,363639,587,116616,211,0001,000,0002,277,376
3Oct 26, 2025 10:3374,420638,286,274616,689,000999,0002,269,184