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 31, 2025 19:25Dmitrii KravchenkoDmitrii KravchenkoScore: 71,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2025 19:2571,155622,165,155587,593,0002,997,0002,285,568
2Mar 31, 2025 19:2571,171612,406,123587,721,0002,998,0002,277,376
3Mar 31, 2025 19:2571,215615,608,254588,087,0003,000,0002,285,568