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 9, 2023 09:48unsatcoreunsatcoreScore: 47,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2023 09:4844,542435,910,525369,701,11802,297,856
2Jan 9, 2023 09:4844,616428,970,962370,314,78702,281,472
3Jan 9, 2023 09:4844,636431,997,294370,478,98802,285,568
4Jan 9, 2023 09:4847,993460,233,399398,342,95802,277,376
5Jan 9, 2023 09:4848,075471,725,798399,019,48802,301,952
6Jan 9, 2023 09:4848,096467,279,281399,199,82402,289,664