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 listAug 7, 2026 14:05TonyTonyScore: 7,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 14:087,58373,394,83960,703,0002,237,0002,113,536
2Aug 7, 2026 14:087,60772,888,14860,942,0002,199,0002,113,536
3Aug 7, 2026 14:087,63473,168,48661,124,0002,245,0002,113,536
4Aug 7, 2026 14:087,65373,293,03661,373,0002,155,0002,113,536
5Aug 7, 2026 14:087,65873,341,85261,381,0002,183,0002,113,536
6Aug 7, 2026 14:087,66073,339,10661,353,0002,228,0002,113,536
7Aug 7, 2026 14:087,69373,667,86861,660,0002,196,0002,113,536
8Aug 7, 2026 14:087,70573,706,69461,728,0002,231,0002,113,536
9Aug 7, 2026 14:087,71173,698,98061,817,0002,186,0002,113,536