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 24, 2024 10:09Sean DewarSean DewarScore: 75,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 10:0975,083653,304,110623,185,00002,273,280
2Dec 24, 2024 10:0975,104652,441,123622,367,0001,000,0002,289,664
3Dec 24, 2024 10:0975,106649,408,779622,382,0001,000,0002,281,472
4Dec 24, 2024 10:0975,132647,165,854621,600,0001,998,0002,289,664
5Dec 24, 2024 10:0975,135651,242,744621,619,0001,998,0002,289,664
6Dec 24, 2024 10:0975,147651,002,158621,720,0001,999,0002,289,664
7Dec 24, 2024 10:0975,190650,231,792622,073,0002,000,0002,289,664
8Dec 24, 2024 10:0975,191647,499,529624,084,00002,285,568
9Dec 24, 2024 10:0975,367644,890,070623,550,0001,998,0002,277,376