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 7, 2024 15:00Evgeniy AsvatovEvgeniy AsvatovScore: 356,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2024 15:01354,8973,011,701,4232,945,648,74002,195,456
2Jan 7, 2024 15:00354,9673,023,045,0492,946,223,80802,207,744
3Jan 7, 2024 15:01355,7223,008,485,4592,952,490,53402,207,744
4Jan 7, 2024 15:00356,8413,031,081,9482,961,781,58602,211,840
5Jan 7, 2024 15:01358,1603,048,090,7132,972,729,06802,195,456
6Jan 7, 2024 15:00358,9713,062,319,1382,979,461,65302,203,648