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 8, 2026 21:50wnwnScore: 4,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 21:504,43764,973,52434,841,0001,990,0002,273,280
2Mar 8, 2026 21:514,44060,401,86334,864,0001,992,0002,273,280
3Mar 8, 2026 21:514,46258,278,47235,031,0002,001,0002,273,280
4Mar 8, 2026 21:504,47156,337,27135,105,0002,006,0002,490,368
5Mar 8, 2026 21:514,50563,451,76936,384,0001,010,0002,273,280
6Mar 8, 2026 21:504,50660,184,47036,391,0001,010,0002,273,280