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 27, 2024 14:40Anoushk KharangateAnoushk KharangateScore: 91,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 13:1690,641816,342,745752,319,49802,203,648
2Apr 28, 2024 13:1690,696815,527,733752,775,25602,207,744
3Apr 27, 2024 14:4091,015817,724,851755,425,38802,215,936
4Apr 28, 2024 13:1691,042816,493,605755,648,04502,207,744
5Apr 27, 2024 14:3991,061816,293,291755,809,66502,207,744
6Apr 27, 2024 14:3991,090816,926,581756,046,13302,215,936
7Apr 27, 2024 14:3991,111817,950,203756,219,48502,211,840
8Apr 27, 2024 14:4091,148812,789,940756,529,96402,207,744
9Apr 27, 2024 14:4091,156821,751,923756,597,57002,211,840