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 listJul 28, 2025 01:00Ruoyu QiuRuoyu QiuScore: 75,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2025 01:0075,835653,548,414627,434,0001,998,0002,277,376
2Jul 28, 2025 01:0075,837655,513,497627,448,0001,998,0002,285,568
3Jul 28, 2025 01:0075,847656,690,990629,533,00002,285,568