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 listApr 24, 2025 20:15Dmitry YudakovDmitry YudakovScore: 75,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 20:1575,897655,456,795627,947,0001,999,0002,297,856
2Apr 24, 2025 20:1575,915658,231,291629,096,0001,000,0002,289,664
3Apr 24, 2025 20:1575,918659,315,154627,120,0003,000,0002,539,520
4Apr 24, 2025 20:1575,920653,979,212627,132,0003,000,0002,396,160
5Apr 24, 2025 20:1575,923657,717,825628,159,0002,000,0002,539,520
6Apr 24, 2025 20:1575,935654,036,618629,259,0001,000,0002,293,760
7Apr 24, 2025 20:1575,936660,512,961627,264,0003,001,0002,293,760
8Apr 24, 2025 20:1575,945658,818,997628,350,0001,997,0002,363,392
9Apr 24, 2025 20:1575,973654,965,955629,575,000999,0002,293,760