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 5, 2026 11:21chereshnya123chereshnya123Score: 63,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 11:2163,745538,188,775472,801,00056,284,0002,113,536
2Jun 5, 2026 11:2163,765538,382,896472,109,00057,144,0002,113,536
3Jun 5, 2026 11:2163,787538,460,361472,207,00057,226,0002,113,536
4Jun 5, 2026 11:2163,790538,551,394472,310,00057,148,0002,113,536
5Jun 5, 2026 11:2163,798538,586,385472,092,00057,432,0002,113,536
6Jun 5, 2026 11:2163,820538,690,757472,516,00057,194,0002,113,536
7Jun 5, 2026 11:2163,883539,251,294473,008,00057,223,0002,113,536
8Jun 5, 2026 11:2163,893539,462,766472,168,00058,149,0002,113,536
9Jun 5, 2026 11:2163,922539,692,818472,341,00058,218,0002,113,536