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 24, 2025 17:34Leon ZhaoLeon ZhaoScore: 67,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2025 17:3467,898596,207,383562,557,000999,0002,523,136
2Jul 24, 2025 17:3467,917590,851,835561,710,0001,998,0002,383,872
3Jul 24, 2025 17:3467,929594,811,344561,812,0001,999,0002,519,040
4Jul 24, 2025 17:3467,948587,983,869561,966,0001,999,0002,375,680
5Jul 24, 2025 17:3467,957597,101,341563,046,0001,000,0002,260,992
6Jul 24, 2025 17:3467,973585,062,076564,176,00002,260,992
7Jul 24, 2025 17:3467,976587,293,463563,198,0001,000,0002,260,992
8Jul 24, 2025 17:3467,982584,754,459563,253,0001,000,0002,256,896
9Jul 24, 2025 17:3467,990585,975,404563,319,0001,000,0002,256,896