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 10, 2025 21:18Hayk KarapetyanHayk KarapetyanScore: 86,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2025 21:1886,294741,667,666716,240,00002,289,664
2Jun 10, 2025 21:1886,631742,922,407718,040,0001,000,0002,289,664
3Jun 10, 2025 21:1886,665743,790,408717,318,0001,998,0002,347,008