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 23, 2025 22:20Valentin KofmanValentin KofmanScore: 11,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 22:208,38196,312,25168,555,0001,008,0002,383,872
2Jun 23, 2025 22:208,384100,047,25868,580,0001,008,0002,265,088
3Jun 23, 2025 22:208,38595,754,78268,589,0001,008,0002,367,488
4Jun 23, 2025 22:2011,586118,930,88695,165,0001,001,0002,289,664
5Jun 23, 2025 22:2011,607120,986,30694,335,0002,007,0002,277,376
6Jun 23, 2025 22:2011,610119,650,15595,361,0001,003,0002,289,664