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 listDec 23, 2024 09:30mahdi739mahdi739Score: 54,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2024 09:3054,271475,824,107450,451,00002,363,392
2Dec 23, 2024 09:3054,296479,297,376448,657,0001,998,0002,379,776
3Dec 23, 2024 09:3054,299479,713,184448,682,0001,998,0002,375,680
4Dec 23, 2024 09:3054,300477,017,096449,693,000999,0002,285,568
5Dec 23, 2024 09:3054,306479,135,525449,740,000999,0002,285,568
6Dec 23, 2024 09:3054,309478,525,387448,764,0001,998,0002,371,584
7Dec 23, 2024 09:3054,312474,244,792448,787,0001,999,0002,285,568
8Dec 23, 2024 09:3054,327476,603,160449,913,000999,0002,285,568
9Dec 23, 2024 09:3054,339478,972,252449,017,0002,000,0002,371,584