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 17:58caandocaandoScore: 5,940Success
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 17:585,85071,061,91947,544,0001,011,0002,285,568
2Nov 4, 2025 17:585,86070,969,08646,652,0001,985,0002,285,568
3Nov 4, 2025 17:585,89371,046,27246,914,0001,996,0002,285,568
4Nov 4, 2025 17:585,94075,542,66647,286,0002,012,0002,285,568
5Nov 4, 2025 17:585,97775,430,89048,594,0001,012,0002,265,088
6Nov 4, 2025 17:586,07373,899,61449,397,0001,008,0002,285,568