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 listJan 21, 2025 23:46Gerard SmitGerard SmitScore: 57,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 23:4657,154501,615,958473,376,0001,000,0002,387,968
2Jan 21, 2025 23:4657,186497,228,850472,642,0001,998,0002,379,776
3Jan 21, 2025 23:4657,190501,138,225472,682,0001,998,0002,314,240
4Jan 21, 2025 23:4657,197502,485,602472,737,0001,998,0002,314,240
5Jan 21, 2025 23:4657,211500,717,912471,853,0002,999,0002,314,240
6Jan 21, 2025 23:4657,217505,605,404472,906,0001,999,0002,314,240
7Jan 21, 2025 23:4657,223501,433,538472,951,0001,999,0002,314,240
8Jan 21, 2025 23:4657,237505,746,162473,067,0002,000,0002,310,144
9Jan 21, 2025 23:4657,355500,747,557472,044,0004,000,0002,383,872