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 25, 2025 20:00Ruoyu QiuRuoyu QiuScore: 541,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2025 20:00541,3224,520,366,9114,290,065,000202,908,0002,351,104
2Jul 25, 2025 20:00541,4774,519,744,2334,322,367,000171,895,0002,277,376
3Jul 25, 2025 20:00544,9784,553,371,7094,324,439,000198,882,0002,269,184