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 listNov 6, 2024 21:26Michael KlimenkoMichael KlimenkoScore: 85,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 21:2685,962740,657,356711,486,0001,998,0002,289,664
2Nov 6, 2024 21:2685,968739,004,957711,538,0001,998,0002,269,184
3Nov 6, 2024 21:2685,971737,294,517711,562,0001,998,0002,265,088
4Nov 6, 2024 21:2685,977740,667,493711,610,0001,998,0002,281,472
5Nov 6, 2024 21:2685,988742,931,130711,702,0001,999,0002,289,664
6Nov 6, 2024 21:2685,991736,758,166711,728,0001,999,0002,289,664
7Nov 6, 2024 21:2686,000738,203,052711,799,0001,999,0002,289,664
8Nov 6, 2024 21:2686,004743,375,282711,831,0001,999,0002,281,472
9Nov 6, 2024 21:2686,024738,114,792713,001,0001,000,0002,359,296