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 listNov 4, 2025 19:58caandocaandoScore: 5,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 19:585,80480,433,07346,163,0002,007,0002,285,568
2Nov 4, 2025 19:585,83974,620,47247,451,0001,009,0002,285,568
3Nov 4, 2025 19:585,84974,292,63447,532,0001,011,0002,519,040
4Nov 4, 2025 19:585,95273,039,72548,394,0001,008,0002,269,184
5Nov 4, 2025 19:585,95375,747,79748,401,0001,008,0002,269,184
6Nov 4, 2025 19:585,98276,802,38448,639,0001,013,0002,285,568