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 listJun 28, 2025 06:27Valentin KofmanValentin KofmanScore: 8,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 06:276,46279,207,00253,635,00002,289,664
2Jun 28, 2025 06:276,48480,800,28852,819,000996,0002,269,184
3Jun 28, 2025 06:276,48677,495,75451,839,0001,993,0002,269,184
4Jun 28, 2025 06:278,21491,453,86766,169,0002,005,0002,289,664
5Jun 28, 2025 06:278,22689,421,33867,270,0001,004,0002,265,088
6Jun 28, 2025 06:278,29198,930,55767,821,000997,0002,289,664