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 listJan 11, 2025 02:39Ian MckibbenIan MckibbenScore: 79,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 02:4379,592684,737,568485,719,000174,898,0002,379,776
2Jan 11, 2025 02:4379,624687,380,422485,910,000174,967,0002,281,472
3Jan 11, 2025 02:3979,730691,355,849485,825,000175,936,0002,281,472
4Jan 11, 2025 02:4379,831690,443,862485,708,000176,893,0002,416,640
5Jan 11, 2025 02:3979,950689,792,923485,695,000177,888,0002,420,736
6Jan 11, 2025 02:3979,998692,182,811486,991,000176,996,0002,445,312