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 2, 2025 14:48CadovvlCadovvlScore: 30,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2025 14:4830,315276,596,729251,611,00002,285,568
2Jun 2, 2025 14:4830,322279,626,878249,672,0001,997,0002,269,184
3Jun 2, 2025 14:4830,324283,237,431249,695,0001,997,0002,285,568
4Jun 2, 2025 14:4830,324283,957,081250,695,000998,0002,285,568
5Jun 2, 2025 14:4830,325278,779,001249,702,0001,997,0002,285,568
6Jun 2, 2025 14:4830,325279,717,831250,703,000998,0002,285,568
7Jun 2, 2025 14:4830,325278,111,725250,702,000998,0002,285,568
8Jun 2, 2025 14:4830,339277,052,639249,814,0001,998,0002,285,568
9Jun 2, 2025 14:4830,354275,665,398249,941,0001,999,0002,285,568