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 2, 2024 20:44Joad NacerJoad NacerScore: 4,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2024 20:444,35757,326,19135,161,0001,004,0002,301,952
2Dec 2, 2024 20:444,40668,451,77036,568,00002,297,856
3Dec 2, 2024 20:444,46859,829,08735,080,0002,004,0002,387,968
4Dec 2, 2024 20:444,60058,823,47736,171,0002,009,0002,531,328
5Dec 2, 2024 20:444,68662,043,40535,903,0002,991,0002,531,328
6Dec 2, 2024 20:444,73961,700,65738,328,0001,008,0002,306,048