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 6, 2025 22:40woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 754,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2025 22:40725,51221,981,586,0312,947,341,0003,074,407,000397,312
2Jan 6, 2025 22:40752,50720,815,594,9322,982,624,0003,263,188,000409,600
3Jan 6, 2025 22:40752,60821,749,970,8473,149,064,0003,097,586,000401,408
4Jan 6, 2025 22:40753,72421,512,443,2683,219,392,0003,036,518,000401,408
5Jan 6, 2025 22:40754,18920,439,264,5243,007,402,0003,252,363,000417,792
6Jan 6, 2025 22:40758,72120,822,268,6432,999,373,0003,298,008,000425,984
7Jan 6, 2025 22:40783,74120,867,201,9643,295,864,0003,209,183,000446,464
8Jan 6, 2025 22:40785,94020,929,296,3593,330,960,0003,192,338,000446,464
9Jan 6, 2025 22:40800,37723,347,133,3053,349,657,0003,293,468,000303,104