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 11, 2024 04:11Chiraag BaluChiraag BaluScore: 72,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2024 04:1172,554666,867,019602,198,55102,265,088
2Jan 11, 2024 04:1372,560695,098,143602,252,03202,269,184
3Jan 11, 2024 04:1372,566674,968,456602,298,00702,301,952
4Jan 11, 2024 04:1172,573670,857,739602,357,14302,269,184
5Jan 11, 2024 04:1372,578663,163,990602,399,16502,256,896
6Jan 11, 2024 04:1172,609664,881,537602,656,81102,260,992