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 listMay 8, 2025 23:17Dmytro OvcharenkoDmytro OvcharenkoScore: 62,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 23:1762,490547,506,385516,666,0001,998,0002,285,568
2May 8, 2025 23:1762,496542,710,233516,719,0001,998,0002,285,568
3May 8, 2025 23:1763,177551,943,879523,373,0001,000,0002,277,376