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 listOct 6, 2025 16:40wnwnScore: 186,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2025 16:40186,8211,575,680,4751,549,616,000999,0002,289,664
2Oct 6, 2025 16:40186,9031,572,956,3721,550,297,000999,0002,371,584
3Oct 6, 2025 16:40187,0261,581,868,1151,551,314,000999,0002,265,088