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 19, 2024 20:28Javid izadiJavid izadiScore: 392,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 20:28390,3933,271,979,6633,163,303,00076,958,0002,285,568
2Dec 19, 2024 20:28392,6083,282,412,8123,191,677,00066,972,0002,281,472
3Dec 19, 2024 20:28394,5283,309,703,5283,194,641,00079,940,0002,363,392