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 listMar 22, 2025 20:20Matthew DowneyMatthew DowneyScore: 157,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2025 20:20156,7811,324,499,6701,299,288,0001,998,0002,289,664
2Mar 22, 2025 20:20157,5531,337,474,5151,306,690,000999,0002,289,664
3Mar 22, 2025 20:20172,8101,461,195,9251,432,325,0001,999,0002,367,488